Odašiljači
레이팅 미적용의견: 0
Sadly, this is the last time Sean will play James Bond.
His mission is to network \(n\) antennas that are scattered across a vast desert, which can
be represented as a 2D plane. He will set the transmission radius of each antenna to
be the same non negative real number \(r\). The range of an antenna is defined as the
set of all points whose distance to the antenna is at most \(r\). If ranges of two antennas
have a common point, those antennas can directly communicate. Also, if antennas \(A\)
and \(B\) can communicate, as well as antennas \(B\) and \(C\), then antennas \(A\) and \(C\) are also
able to communicate, through antenna \(B\).
Sean wants to network the antennas, i.e. make possible for every two antennas to
communicate. Since \(M\) has limited his spending for this mission, and larger radii require
more money, Sean will choose the smallest possible radius \(r\). Help him solve this
problem!
In test cases worth 35 points it holds that \(1 \le n \le 100\).
The first line contains an integer \(n\) (\(1 \le n \le 1000\)), the number of antennas.
Each of the following \(n\) lines contains integers \(x@@RISE_MATH_BLOCK_0@@i\) (\(0 \le x\)\(i\), y\(i \le 10^{9}\)), coordinates of the \(i-th\) antenna.
Output the minimal radius.
Your answer will be considered correct if its absolute or relative error doesn’t exceed \(10^{−}\)^{6}.
2
1 1
2 20.70710687
2 3
3 4
4 5
0 1
3 1
4 2
1 51.41421354
2020 20
20 2020
2020 2020
20 201000.0000000Clarification of the second example:
−2
−1
0
1
2
3
4
5
6
1
2
3
4
5
6
7
−1
평가 및 의견
Odašiljači
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Odašiljači