1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
|
#include <bits/stdc++.h>
namespace IO {
inline char read() {
static const int IN_LEN = 1000000;
static char buf[IN_LEN], *s, *t;
s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin) : 0;
return s == t ? -1 : *s++;
}
template<typename T>
inline void read(T &x) {
static char c;
static bool iosig;
for (c = read(), iosig = false; !isdigit(c); c = read()) {
if (c == -1) return;
iosig ? x = -x : 0;
}
for (x = 0; isdigit(c); c = read())
x = (x + (x << 2) << 1) + (c ^ '0');
iosig ? x = -x : 0;
}
inline int read(char *buf) {
register int s = 0;
register char c;
while (c = read(), isspace(c) && c != -1);
if (c == -1) {
*buf = '\0';
return -1;
}
do buf[s++] = c; while (c = read(), !isspace(c) && c != -1);
buf[s] = '\0';
return s;
}
inline void read(double &x) {
static char buf[30];
read(buf), x = atof(buf);
}
const int OUT_LEN = 1000000;
char obuf[OUT_LEN], *oh = obuf;
inline void print(char c) {
oh == obuf + OUT_LEN ? (fwrite(obuf, 1, OUT_LEN, stdout), oh = obuf) : 0;
*oh++ = c;
}
template<typename T>
inline void print(T x) {
static int buf[30], cnt;
if (x == 0) {
print('0');
} else {
x < 0 ? (print('-'), x = -x) : 0;
for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 | 48;
while (cnt) print((char)buf[cnt--]);
}
}
inline void flush() {
fwrite(obuf, 1, oh - obuf, stdout);
}
}
namespace Task {
const int MAXN = 100005;
const double EPS = 1e-8;
template<typename T>
inline T square(const T &x) {
return x * x;
}
struct Point {
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
inline double dis(const Point &p) const {
return sqrt(square(x - p.x) + square(y - p.y));
}
inline Point operator+(const Point &p) const {
return Point(x + p.x, y + p.y);
}
inline Point operator-(const Point &p) const {
return Point(x - p.x, y - p.y);
}
inline Point operator*(const double i) const {
return Point(x * i, y * i);
}
inline double operator*(const Point &p) const {
return x * p.y - y * p.x;
}
inline double operator^(const Point &p) const {
return x * p.x + y * p.y;
}
inline Point operator/(const double i) const {
return Point(x / i, y / i);
}
inline void read() {
IO::read(x), IO::read(y);
}
} p[MAXN];
struct Circle {
Point o;
double r;
Circle(const Point &o, const double r) : o(o), r(r) {}
Circle() {}
};
struct Line {
Point s, t;
Line(const Point &s, const Point &t) : s(s), t(t) {}
inline Point intersect(const Line &l) const {
return s + (t - s) * (((s - l.s) * (l.t - l.s)) / ((l.t - l.s) * (t - s)));
}
inline Line getPerpendicularBisector() {
return Line(Point((s.x + t.x) / 2, (s.y + t.y) / 2),
Point((s.x + t.x) / 2 + s.y - t.y, (s.y + t.y) / 2 + t.x - s.x));
}
};
inline Point getCenter(const Point &a, const Point &b, const Point &c) {
return Line(a, b).getPerpendicularBisector().
intersect(Line(a, c).getPerpendicularBisector());
}
inline void solve() {
using namespace IO;
srand(495);
register int n;
read(n);
for (register int i = 1; i <= n; i++) p[i].read();
std::random_shuffle(p + 1, p + n + 1);
Circle c(p[1], 0);
for (register int i = 1; i <= n; i++) {
if (c.o.dis(p[i]) - c.r < EPS) continue;
c = Circle((p[1] + p[i]) / 2, p[1].dis(p[i]) / 2);
for (register int j = 2; j < i; j++) {
if (c.o.dis(p[j]) - c.r < EPS) continue;
c = Circle((p[i] + p[j]) / 2, p[i].dis(p[j]) / 2);
for (register int k = 1; k < j; k++) {
if (c.o.dis(p[k]) - c.r < EPS) continue;
c = Circle(getCenter(p[i], p[j], p[k]), c.r);
c.r = c.o.dis(p[k]);
}
}
}
printf("%.5lf\n%.5lf %.5lf\n", c.r, c.o.x, c.o.y);
}
}
int main() {
#ifdef DBG
freopen("in.in", "r", stdin);
#endif
Task::solve();
return 0;
}
|
