| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 | 1024 MB | 93 | 24 | 16 | 25.000% |
JAG-island is a rectangular island on the $xy$-plane. The 4 coastlines of JAG-island are parallel to the $x$-axis or the $y$-axis. The left-bottom and right-top corners of JAG-island are located at $(0,0)$ and $(W,H),ドル respectively.
There are $N$ stations in JAG-island. The $i$-th station is located in $(x_i, y_i)$. You are interested in the coordinates that maximize the (Euclidean) distance to the nearest station. Find the distance from such a coordinate to its nearest station. In other words, calculate the value of $$\max_{0 ≤ x ≤ W,0円 ≤ y ≤ H}\min_{i}\sqrt{\left(x-x_i\right)^2 + \left(y-y_i\right)^2}\text{.}$$
$N$ $W$ $H$
$x_1$ $y_1$
$\vdots$
$x_N$ $y_N$
The first line of the input consists of three integers, the number $N$ (1ドル ≤ N ≤ 2,000円$) of stations, the width $W$ and the height $H$ (1ドル ≤ W, H ≤ 1,000円$) of JAG-island.
The $i$-th of the following $N$ lines has two integers $x_i$ and $y_i$ (0ドル ≤ x_i ≤ W,ドル 0ドル ≤ y_i ≤ H$), which represent the coordinate of the $i$-th station. The coordinates of stations are distinct, i.e. $(x_i, y_i) \ne (x_j, y_j)$ for any $i,ドル $j$ ($i \ne j$).
Print the answer in a line. Absolute or relative errors less than 10ドル^{-6}$ are permissible.
1 1 1 0 0
1.41421356237
1 4 4 2 2
2.82842712475
2 6 6 3 1 3 5
3.60555127546
4 10 10 1 1 1 9 9 1 9 9
5.65685424949
9 10 10 1 1 1 5 1 9 5 1 5 5 5 9 9 1 9 5 9 9
2.82842712475