|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||11||4||3||30.000%|
The well-known mobile network operator Totalphone has set up a number of new base transceiver stations in order to cover a newly-built highway with its network. As always the programmers of Totalphone have been sloppy; as a result, the transmission power cannot be set up individually for the stations, but one can only set the transmission power to a fixed common value for all the stations. In order to minimize power consumption, the company wants to know the maximal distance of a point on the highway to the nearest base transceiver station.
The first line of text file mobile.in consists of two integers N(1 ≤ N ≤ 106) and L(1 ≤ L ≤ 109) representing the number of base transceiver stations and the length of the highway, respectively. N lines follow, each containing a pair of integers xi, yi (-109 ≤ xi, yi ≤109) which describes the coordinates of a base transceiver station. All points are distinct. Coordinates are sorted in the non-decreasing order with respect to xi coordinates. If two values of xi are the same, then coordinates are sorted with respect to yi coordinates in increasing order.
The highway is a straight line ranging from (0; 0) to (L; 0).
The first and only line of the text file mobile.out should contain a single number - the maximal distance of a point on the highway to the nearest base transceiver station. Your output will be regarded as correct if it differs by at most 10-3 from the precise result.
2 10 0 0 11 1