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

hpotter97762's blog

Help needed with div2 #435 problem E
By hpotter97762, history, 9 years ago, In English

Here is the problem this

And this is my solution this

According to my analysis, the solution should be O( q*log(m-n)+m ). So, with n<=10000, I am not able to find why I am getting TLE or where is the code going in infinite loop...

Any help would be appreciated.... Thanks in advance!!

  • Vote: I like it
  • -1
  • Vote: I do not like it

»
9 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Thanks guys!!! Got AC in my solution... Apparently, I was passing the vector into binary search function by value due to which copying took O(n) time in every query, leading to TLE.

→ Reply