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
|
/*
power by Solo_Dance
*/
#include <bits/stdc++.h>
#define eps 1e-8
using namespace std;
#define ms(a, b) memset((a), (b), sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int N = 202 + 5;
const int M = 1e6 + 5;
const int INF = 0x3f3f3f3f;
const ll ll_max = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
inline ll read() {
ll res = 0;bool f = 0;char ch = getchar();
while (ch < '0' || ch > '9') {if (ch == '-') f = 1;ch = getchar();}
while (ch <= '9' && ch >= '0') {res = (res << 3) + (res << 1) + ch - '0';ch = getchar();}
return f ? (~res + 1) : res;
}
struct node{
int x, y, r;
}a[202];
namespace DSU{
int f[N], siz[N];
inline void init(){
for (int i = 0; i < N; ++i) f[i] = i, siz[i] = 1;
}
inline int tofind(int x){
if (f[x] != x) f[x] = tofind(f[x]);
return f[x];
}
inline void tojoin(int a, int b){
a = tofind(a), b = tofind(b);
if (siz[a] > siz[b]) swap(a, b);
f[a] = b; siz[b] = max(siz[b], siz[a] + 1);
}
};
using namespace DSU;
bool is(int x, int y){
int dis = (a[x].x - a[y].x) * (a[x].x - a[y].x) + (a[x].y - a[y].y) * (a[x].y - a[y].y);
return dis < (a[x].r + a[y].r) * (a[x].r + a[y].r);
}
int main(){
int n = read();
init();
for (int i = 1; i <= n; ++i) {
a[i].x = read(), a[i].y = read(), a[i].r = read();
if (a[i].x - a[i].r <= 0) tojoin(i, 0);
if (a[i].x + a[i].r >= 200) tojoin(i, n + 1);
for (int j = 1; j < i; ++j) if (is(i, j)) tojoin(i, j);
if (tofind(0) == tofind(n + 1)){
cout << i - 1 << "\n";
return 0;
}
}
cout << n << "\n";
return 0;
}
|
