Thank you for noticing.

The contest starts in ~3h.

I solved it using dynamic programming. Sort all the positions and try all possibilities. Here's my solution for reference https://www.codechef.com/viewsolution/18338444

I solved it using 2-d dp, where one state is of index on which you are and 2nd state is the direction of previous index ( ie it went left or right ).

Have a look at this for transitions.

First sort all points by x co-ordinate.

Now binary search on time and greedily assign left or right to all points (first try to assign left if not assign right). If it is possible to assign all points then the given time is possible

My solution : https://www.codechef.com/viewsolution/18338433

Spent 2hrs debugging my solution, but couldn't, Can anyone find any bugs in my solution.

Morphy can you give me the testcase on which my code fails? Thanks :)

Link to solution

never mind, had some bug while printing double value