There is a fuzzy point in the description. That is all the car has to wait the same amount of time. For example,
This is a rounding problem. Since it has only three number after the point, you just need to find the last number n and if it's more than four...
This problem is gcd or lcm problem.
The core of the problem is Dichotomy which is Binary search the best range of the X.
For me, the core of the problem is to figure out how the matches carry on exactly. It's the hardest part for me.
Position of the house can be divided into two situation, Uphill slope and Downhill slope. And the two situations are used to calculate the Y position of the house.
From the description above we can draw that the Voronoi Diagram is drawn not casually but with some rules and the role can only correspond to one kind of the diagram.
we just find the position of the character '.' and '/' and '%' and reverse the string before and after the character and omit the front zeros.
