Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

bc_mc_bsdk_mkc's blog

help in Binary String Reconstruction(edu round#94)
By bc_mc_bsdk_mkc, history, 6 years ago, In English

I stucked in this question for long now I tried in almost all possible cases but still it kept showing wrong answer on test#2 please help, whats wrong in my code or you can give some strong test cases.

https://codeforces.me/contest/1400/submission/91015416

  • Vote: I like it
  • +11
  • Vote: I do not like it

Comments Comments (1)
| Write comment?
»
6 years ago, hide # |
 
Vote: I like it +9 Vote: I do not like it

So the condiiton you are missing is this-

While operating for characters i=0 to i=(x-1), u directly set the character in string w as s[i] if (i+x)<n, what if (i+x)>=n, and the string s has a '1' at position i. In that case, you need to print (-1) as the answer.

Corrected code

Similarly for i =(n-x) to (n-1).

Hope you get it :)

Link to your AC submission

→ Reply