/* There's someone in my head but it's not me */
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
#define SZ(x) (int) x.size()
#define F first
#define S second
const int N = 3e5 + 10, MOD = 1e9 + 7;
int n, X[N], Y[N], R[N], ord[N], ret[N];
int intersect(int i, int j) {
ll x1 = X[i], x2 = X[j], y1 = Y[i], y2 = Y[j], r1 = R[i], r2 = R[j];
return x1 * x1 + x2 * x2 + y1 * y1 + y2 * y2 - r1 * r1 - r2 * r2 <= 2 * (r1 * r2 + x1 * x2 + y1 * y2);
}
void sub1() {
for (int _ = 1; _ <= n; _++) {
int i = ord[_];
if (ret[i]) continue;
ret[i] = i;
for (int j = _ + 1; j <= n; j++) {
if (!ret[ord[j]] && intersect(i, ord[j])) ret[ord[j]] = i;
}
}
for (int i = 1; i <= n; i++)
printf("%d ", ret[i]);
printf("\n");
exit(0);
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d%d%d", &X[i], &Y[i], &R[i]);
iota(ord + 1, ord + n + 1, 1);
sort(ord + 1, ord + n + 1, [&] (int i, int j) { return R[i] == R[j] ? i < j : R[i] > R[j]; });
if (n * n <= 1e8) sub1();
set<pair<ll, int>, greater<pair<ll, int>>> st;
for (int i = 1; i <= n; i++)
st.insert({X[i] + R[i], i});
for (int _ = 1; _ <= n; _++) {
int i = ord[_];
if (ret[i]) continue;
ret[i] = i; st.erase({X[i] + R[i], i});
while (SZ(st) && st.begin()->F >= X[i] - R[i]) {
ret[st.begin()->S] = i;
st.erase(st.begin());
}
}
for (int i = 1; i <= n; i++) printf("%d ", ret[i]);
printf("\n");
return 0;
}
Compilation message
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
37 | scanf("%d", &n);
| ~~~~~^~~~~~~~~~
circle_selection.cpp:39:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
39 | scanf("%d%d%d", &X[i], &Y[i], &R[i]);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
1 ms |
204 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
332 KB |
Output is correct |
17 |
Correct |
1 ms |
332 KB |
Output is correct |
18 |
Correct |
1 ms |
332 KB |
Output is correct |
19 |
Correct |
4 ms |
336 KB |
Output is correct |
20 |
Correct |
3 ms |
332 KB |
Output is correct |
21 |
Correct |
4 ms |
332 KB |
Output is correct |
22 |
Correct |
95 ms |
416 KB |
Output is correct |
23 |
Correct |
93 ms |
416 KB |
Output is correct |
24 |
Correct |
93 ms |
404 KB |
Output is correct |
25 |
Correct |
92 ms |
332 KB |
Output is correct |
26 |
Correct |
92 ms |
400 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
195 ms |
8160 KB |
Output is correct |
2 |
Correct |
194 ms |
8204 KB |
Output is correct |
3 |
Correct |
189 ms |
7876 KB |
Output is correct |
4 |
Correct |
182 ms |
8252 KB |
Output is correct |
5 |
Execution timed out |
3060 ms |
6040 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
102 ms |
9032 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3059 ms |
4984 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
1 ms |
204 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
332 KB |
Output is correct |
17 |
Correct |
1 ms |
332 KB |
Output is correct |
18 |
Correct |
1 ms |
332 KB |
Output is correct |
19 |
Correct |
4 ms |
336 KB |
Output is correct |
20 |
Correct |
3 ms |
332 KB |
Output is correct |
21 |
Correct |
4 ms |
332 KB |
Output is correct |
22 |
Correct |
95 ms |
416 KB |
Output is correct |
23 |
Correct |
93 ms |
416 KB |
Output is correct |
24 |
Correct |
93 ms |
404 KB |
Output is correct |
25 |
Correct |
92 ms |
332 KB |
Output is correct |
26 |
Correct |
92 ms |
400 KB |
Output is correct |
27 |
Correct |
6 ms |
460 KB |
Output is correct |
28 |
Correct |
6 ms |
464 KB |
Output is correct |
29 |
Correct |
7 ms |
460 KB |
Output is correct |
30 |
Correct |
398 ms |
504 KB |
Output is correct |
31 |
Correct |
395 ms |
580 KB |
Output is correct |
32 |
Correct |
374 ms |
504 KB |
Output is correct |
33 |
Correct |
105 ms |
9028 KB |
Output is correct |
34 |
Correct |
112 ms |
9112 KB |
Output is correct |
35 |
Incorrect |
127 ms |
9172 KB |
Output isn't correct |
36 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
1 ms |
204 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
332 KB |
Output is correct |
17 |
Correct |
1 ms |
332 KB |
Output is correct |
18 |
Correct |
1 ms |
332 KB |
Output is correct |
19 |
Correct |
4 ms |
336 KB |
Output is correct |
20 |
Correct |
3 ms |
332 KB |
Output is correct |
21 |
Correct |
4 ms |
332 KB |
Output is correct |
22 |
Correct |
95 ms |
416 KB |
Output is correct |
23 |
Correct |
93 ms |
416 KB |
Output is correct |
24 |
Correct |
93 ms |
404 KB |
Output is correct |
25 |
Correct |
92 ms |
332 KB |
Output is correct |
26 |
Correct |
92 ms |
400 KB |
Output is correct |
27 |
Correct |
195 ms |
8160 KB |
Output is correct |
28 |
Correct |
194 ms |
8204 KB |
Output is correct |
29 |
Correct |
189 ms |
7876 KB |
Output is correct |
30 |
Correct |
182 ms |
8252 KB |
Output is correct |
31 |
Execution timed out |
3060 ms |
6040 KB |
Time limit exceeded |
32 |
Halted |
0 ms |
0 KB |
- |