Problem Statement | |||||||||||||
An object is placed in the xy-plane at coordinates (x,y), where x > 0 and y > 0. The object begins falling straight down toward the x-axis at a speed of one unit per second. Along the way, it may encounter some obstacles. Each obstacle is a horizontal line segment, and the object hits an obstacle when their y-coordinates are equal and the object's x-coordinate is between the x-coordinates of the obstacle's endpoints (inclusive). Each time the object hits an obstacle, it will be delayed 5 seconds. During this delay, the object will travel to the right endpoint of the obstacle (the one with the greater x-coordinate). The object will then continue to fall straight down from that point. You are given the object's initial position (x,y) and a String[] describing the obstacles. Return the number of seconds it will take for the object to finally reach the x-axis. Each element of obstacles is formatted "y x1 x2" (quotes for clarity only), where y is the y-coordinate of an obstacle, and x1 and x2 are the left and right x-coordinates of that obstacle's endpoints respectively. | |||||||||||||
Definition | |||||||||||||
| |||||||||||||
Constraints | |||||||||||||
- | x will be between 1 and 1000, inclusive. | ||||||||||||
- | y will be between 1 and 1000, inclusive. | ||||||||||||
- | obstacles will contain between 0 and 50 elements, inclusive. | ||||||||||||
- | Each element of obstacles will be formatted "y x1 x2" (quotes for clarity only). | ||||||||||||
- | Each y, x1 and x2 in obstacles will be an integer between 001 and 999, inclusive, and contain exactly 3 digits. | ||||||||||||
- | In each element of obstacles, x1 will be less than or equal to x2. | ||||||||||||
- | obstacles will contain no duplicate y values. | ||||||||||||
Examples | |||||||||||||
0) | |||||||||||||
| |||||||||||||
1) | |||||||||||||
| |||||||||||||
2) | |||||||||||||
| |||||||||||||
3) | |||||||||||||
| |||||||||||||
4) | |||||||||||||
| |||||||||||||
5) | |||||||||||||
|