Codeforces Round 168 (Div. 2)
E
The Last Hole!
Codeforces
未评级
原题
← D→
翻译中…

Luyi has $*n*$ circles on the plane. The $*i*$-th circle is centered at $(*x*_{*i*}, *y*_{*i*})$. At the time zero circles start to grow simultaneously. In other words, the radius of each circle at time $*t* (*t* > 0)$ is equal to $*t*$. The circles are drawn as black discs on an infinite white plane. So at each moment the plane consists of several black and white regions. Note that the circles may overlap while growing.

翻译中…

image

翻译中…

We define a hole as a closed, connected white region. For instance, the figure contains two holes shown by red border. During growing some holes may be created and it is easy to see that each created hole will disappear eventually. Luyi asks you to find moment of time such that the last hole disappears. In other words, you should find the first moment such that no hole can be seen after that.

翻译中…

Input

翻译中…

The first line of the input contains integer $*n*$ ($1 ≤ *n* ≤ 100$). Each of the next $*n*$ lines contains two integers $*x*_{*i*}$ and $*y*_{*i*}$ ($- 10^{4} ≤ *x*_{*i*}, *y*_{*i*} ≤ 10^{4}$), indicating the location of $*i*$-th circle.

翻译中…

It's guaranteed that no two circles are centered at the same point.

翻译中…

Output

翻译中…

Print the moment where the last hole disappears. If there exists no moment in which we can find holes print -1.

翻译中…

The answer will be considered correct if the absolute or relative error does not exceed $10^{ - 4}$.

翻译中…

样例

Input #1
3
0 0
1 1
2 2
Output #1
-1
InputCopy OutputCopy
Input #2
4
0 0
0 2
2 2
2 0
Output #2
1.414214
InputCopy OutputCopy
Input #3
4
0 1
0 -1
-2 0
4 0
Output #3
2.125000
InputCopy OutputCopy
题目信息
题号
275E
时间限制
2 s
内存限制
256 MB

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