Case of Fugitive of round 310 is a very nice problem, special thanks to AndreySergunin After finding solution with binary search , I was trying to solve it using segment/interval tree.
I was getting WA, Then I tested the input of test case 5 in "codeblocks : windows 7" I got same verdict as jury's but the output in codeforces compiler for my code is "No".
Dont know why, maybe somekind of gcc bug , can anyone please explain it. It will surely help to improve my coding style. Thanks in advance.
AC using GNU C++11 or MS C++, see my last submissions
submit code with undefined behavior: unrated — WA, IM — AC. Coincidence? Don't think so!
I believe that's because codeforces system detects your rating. If you're yellow or red, it will offer only big zeroed chunks of memory, and of cource no instructions shuffling.
You are right! My advice is:
STOP being blue!
nay, I think it's ok to be blue
Well, if your name is not written in red, you don't get:
And many, many things!
There is a buffer overflow on this line:
In test case 5,
seg.size() == 4N == 5.