forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathI.cpp
More file actions
73 lines (57 loc) · 1.78 KB
/
I.cpp
File metadata and controls
73 lines (57 loc) · 1.78 KB
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
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
#define SZ(X) ((int) ((X).size()))
using namespace std;
const int MN = 1211;
int n;
double x[MN], y[MN], c[MN][MN], val;
int color[MN];
void dfs(int u) {
FOR(v,1,n) if (v != u && c[u][v] < val) {
if (color[v] == color[u]) throw 1;
if (!color[v]) {
color[v] = 3 - color[u];
dfs(v);
}
}
}
bool check(double val) {
::val = val;
memset(color, 0, sizeof color);
FOR(i,1,n) if (!color[i]) {
color[i] = 1;
try {
dfs(i);
} catch (...) {
return false;
}
}
return true;
}
int main() {
ios :: sync_with_stdio(false);
freopen("radio.in", "r", stdin);
freopen("radio.out", "w", stdout);
cout << (fixed) << setprecision(12);
while (cin >> n) {
FOR(i,1,n) cin >> x[i] >> y[i];
FOR(i,1,n) FOR(j,1,n) c[i][j] = sqrt(sqr(x[i] - x[j]) + sqr(y[i] - y[j]));
double l = 0, r = 4e4;
REP(turn,80) {
double mid = (l + r) / 2.0;
if (check(mid)) l = mid;
else r = mid;
}
cout << l / 2.0 << endl;
check(l);
FOR(i,1,n) cout << color[i] << ' '; cout << endl;
}
}