Time limit : 5 s | Memory limit : 32 mb |
---|---|

Submitted : 210 | Accepted : 114 |

The GX Light Pipeline Company started to prepare bent pipes for the new transgalactic light pipeline. During the design phase of the new pipe shape the company ran into the problem of determining how far the light can reach inside each component of the pipe. Note that the material which the pipe is made from is not transparent and not light reflecting.

Each pipe component consists of many straight pipes connected tightly together. For the programming
purposes, the company developed the description of each component as a sequence of points [*x*1; *y*1], [*x*2; *y*2],
. . ., [*xn*; *yn*], where *x*1 < *x*2 < . . . *xn* . These are the upper points of the pipe contour. The bottom points
of the pipe contour consist of points with *y*-coordinate decreased by 1. To each upper point [*xi*; *yi*] there
is a corresponding bottom point [*xi*; (*yi*)-1] (see picture above). The company wants to find, for each pipe component, the point with maximal *x*-coordinate that the light will reach. The light is emitted by a segment source with endpoints [*x*1; (*y*1)-1] and [*x*1; *y*1] (endpoints are emitting light too). Assume that the light is not bent at the pipe bent points and the bent points do not stop the light beam.

4 0 1 2 2 4 1 6 4 6 0 1 2 -0.6 5 -4.45 7 -5.57 12 -10.8 17 -16.55 0

4.67 Through all the pipe.