You can get the whole input data as a big string with stdin.read() [don't forget to import stdin from the sys module].

be confirmed that input limit is covered by your program

Try to use unsigned long long, because 10^18>2^32

the array is too small,you can try global array to solve it ,but it should be large,at least

500000

Just instead of "if(res2>res1)" "if(res2>=res1)"

Hi,

I encountered the same result (WA @ 13) as you did, and after a second thought, I realized that we had misunderstood the problem statement, in which an important sentence shall be noted:

"Since such a meeting would likely be fatal, it cannot be allowed until the job is done."

Remember that you need to wait for the rebel leader to appear at TIME_IN_INPUT. Therefore, if you take another round-trip to arrive at sometime earlier than first arrival, you would definitely meet yourself, which would be fatal. That's why we need to terminate the program once we arrive at the destination earlier than TIME_IN_INPUT.

BTW, it SEEMS that terminating the BFS process in such a way would lead to the smallest k.

If solution with no more than 10^9 rubles, output it. Else find the first record, after which salary with more than 10^9 rubles appears (or contradiction between salaries).

n*max(|d|) <= 1e9

And what's cool here? IMHO, quite standard DP. Don't understand, why so few authors have solved it...

By binary search and submitting find this test =)

Test 3 is
1 5
2 8
3 10
4 9
5 5
answer is 2

Your solution is correct for every case. But whats your answer for 0? I think it should be 1. But its not testing case 0.

Edited by author 06.05.2013 19:19

Edited by author 06.05.2013 19:19

Edited by author 06.05.2013 19:21

First 3 elements are answer there. Check default answer if nothing better than beggining is given