AtCoder Beginner Contest 181
F
Silver Woods
AtCoder
⌀ 2009
原题
← E→
翻译中…

Problem Statement

翻译中…

On the $xy$-plane, we have a passage surrounded by the two lines $y=-100$ and $y=100$.

翻译中…

In the part of this passage with $-100 < x < 100$, there are $N$ negligibly small nails. The coordinates of the $i$-th nail are $(x_i, y_i)$.

翻译中…

Takahashi will choose a real number $r \ (0 < r \leq 100)$ and put a circle of radius $r$ so that its center is at $(-10^9, 0)$.

翻译中…

Then, he will move the circle from $(-10^9, 0)$ to $(10^9, 0)$.

翻译中…

Here, he continuously moves the circle so that the boundaries of the passage or the nails do not penetrate the interior of the circle.

翻译中…

Find the maximum possible value of $r$ such that it is possible to move the circle to $(10^9, 0)$.

翻译中…

Constraints

翻译中…
  • All values in input are integers.
  • $1 \leq N \leq 100$
  • $|x_i|, |y_i| < 100$
  • If $i \neq j$, $(x_i, y_i) \neq (x_j, y_j)$.
翻译中…

Input

翻译中…

Input is given from Standard Input in the following format:

翻译中…

N
x_1 y_1
\vdots
x_N y_N

翻译中…

Output

翻译中…

Print the maximum possible value of $r$ such that it is possible to move the circle to $(10^9, 0)$. Your output will be considered correct when its absolute or relative error from our answer is at most $10^{-4}$.

翻译中…

样例

Input #1
2
0 -40
0 40
Output #1
40
![image](https://img.atcoder.jp/ghi/493d8b75d6dd331fcc0f3949f12262b3.jpg) As shown in the figure, we can move the circle with $r=40$ from $(-10^9, 0)$ to $(10^9, 0)$ by moving it along $y=0$. When $x=0$, the circle exactly touches the two nails, which is fine since they do not penetrate the interior of the circle. Any value of $r$ greater than $40$ makes it impossible to move the circle to $(10^9, 0)$, so the maximum possible value is $r=40$.
Input #2
4
0 -10
99 10
0 91
99 -91
Output #2
50.5
Input #3
10
-90 40
20 -30
0 -90
10 -70
80 70
-90 30
-20 -80
10 90
50 30
60 -70
Output #3
33.541019662496845446
Input #4
10
65 -90
-34 -2
62 99
42 -13
47 -84
84 87
16 -78
56 35
90 8
90 19
Output #4
35.003571246374276203
题目信息
题号
abc181_f
时间限制
2 s
内存限制
1024 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。