/* There's someone in my head but it's not me */
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
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 + 4, MOD = 1e9 + 7;
int n, X[N], Y[N], R[N], ord[N], xord[N], pos[N], ret[N]; vector<int> ids;
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);
}
struct node : set<pii> {
node *lc, *rc;
node() : lc(nullptr), rc(nullptr) {}
void build(int l = 1, int r = n + 1) {
for (int i = l; i < r; i++) {
this->insert({Y[xord[i]], xord[i]});
}
if (r - l < 2) return;
int md = (l + r) >> 1;
lc = new node(), rc = new node();
lc->build(l, md), rc->build(md, r);
}
void remove(int &p, int &id, int l = 1, int r = n + 1) {
this->erase({Y[id], id});
if (r - l < 2) return;
int md = (l + r) >> 1;
if (p < md) lc->remove(p, id, l, md);
else rc->remove(p, id, md, r);
}
void get(ll xl, ll xr, ll yl, ll yr, int &id, node* &rt, int l = 1, int r = n + 1) {
if (xr <= X[xord[l]] || X[xord[r - 1]] + 1 <= xl || this->empty()) return;
if (xl <= X[xord[l]] && X[xord[r - 1]] + 1 <= xr) {
for (auto it = this->lower_bound({yl, -1e9}); it != this->end() && it->F <= yr; ) {
auto x = *it;
if (ret[x.S]) this->erase(x);
else if (intersect(id, x.S)) ret[x.S] = id;
it = this->upper_bound(x);
}
return;
}
int md = (l + r) >> 1;
lc->get(xl, xr, yl, yr, id, rt, l, md), rc->get(xl, xr, yl, yr, id, rt, md, r);
}
};
node* seg;
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);
iota(xord + 1, xord + n + 1, 1);
sort(ord + 1, ord + n + 1, [&] (int i, int j) { return R[i] == R[j] ? i < j : R[i] > R[j]; });
sort(xord + 1, xord + n + 1, [&] (int i, int j) { return X[i] < X[j]; });
seg = new node(); seg->build();
for (int i = 1; i <= n; i++) pos[xord[i]] = i;
for (int _ = 1; _ <= n; _++) {
int i = ord[_];
if (ret[i]) continue;
seg->get(X[i] - 2ll * R[i], X[i] + 2ll * R[i] + 1, Y[i] - 2ll * R[i], Y[i] + 2ll * R[i], i, seg);
}
for (int i = 1; i <= n; i++) printf("%d ", ret[i]);
printf("\n");
return 0;
}
Compilation message
circle_selection.cpp:3: warning: ignoring #pragma comment [-Wunknown-pragmas]
3 | #pragma comment(linker, "/stack:200000000")
|
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
66 | scanf("%d", &n);
| ~~~~~^~~~~~~~~~
circle_selection.cpp:68:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
68 | scanf("%d%d%d", &X[i], &Y[i], &R[i]);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
304 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
300 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
332 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
332 KB |
Output is correct |
16 |
Correct |
3 ms |
972 KB |
Output is correct |
17 |
Correct |
3 ms |
972 KB |
Output is correct |
18 |
Correct |
3 ms |
972 KB |
Output is correct |
19 |
Correct |
13 ms |
4556 KB |
Output is correct |
20 |
Correct |
13 ms |
4556 KB |
Output is correct |
21 |
Correct |
14 ms |
4476 KB |
Output is correct |
22 |
Correct |
20 ms |
4428 KB |
Output is correct |
23 |
Correct |
17 ms |
4556 KB |
Output is correct |
24 |
Correct |
15 ms |
4556 KB |
Output is correct |
25 |
Correct |
15 ms |
4468 KB |
Output is correct |
26 |
Correct |
15 ms |
4428 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1372 ms |
329204 KB |
Output is correct |
2 |
Correct |
1402 ms |
329440 KB |
Output is correct |
3 |
Correct |
1422 ms |
329128 KB |
Output is correct |
4 |
Correct |
1354 ms |
329492 KB |
Output is correct |
5 |
Correct |
1383 ms |
329340 KB |
Output is correct |
6 |
Correct |
1528 ms |
329388 KB |
Output is correct |
7 |
Correct |
1401 ms |
329380 KB |
Output is correct |
8 |
Correct |
1415 ms |
329252 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
592 ms |
102684 KB |
Output is correct |
3 |
Correct |
2273 ms |
329028 KB |
Output is correct |
4 |
Correct |
2259 ms |
329404 KB |
Output is correct |
5 |
Correct |
2153 ms |
319940 KB |
Output is correct |
6 |
Correct |
868 ms |
165316 KB |
Output is correct |
7 |
Correct |
375 ms |
83828 KB |
Output is correct |
8 |
Correct |
54 ms |
15976 KB |
Output is correct |
9 |
Correct |
2230 ms |
329288 KB |
Output is correct |
10 |
Correct |
2220 ms |
329448 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2078 ms |
329060 KB |
Output is correct |
2 |
Correct |
1884 ms |
329256 KB |
Output is correct |
3 |
Correct |
1711 ms |
328872 KB |
Output is correct |
4 |
Correct |
1820 ms |
329456 KB |
Output is correct |
5 |
Correct |
1832 ms |
329096 KB |
Output is correct |
6 |
Correct |
1595 ms |
328272 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
304 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
300 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
332 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
332 KB |
Output is correct |
16 |
Correct |
3 ms |
972 KB |
Output is correct |
17 |
Correct |
3 ms |
972 KB |
Output is correct |
18 |
Correct |
3 ms |
972 KB |
Output is correct |
19 |
Correct |
13 ms |
4556 KB |
Output is correct |
20 |
Correct |
13 ms |
4556 KB |
Output is correct |
21 |
Correct |
14 ms |
4476 KB |
Output is correct |
22 |
Correct |
20 ms |
4428 KB |
Output is correct |
23 |
Correct |
17 ms |
4556 KB |
Output is correct |
24 |
Correct |
15 ms |
4556 KB |
Output is correct |
25 |
Correct |
15 ms |
4468 KB |
Output is correct |
26 |
Correct |
15 ms |
4428 KB |
Output is correct |
27 |
Correct |
28 ms |
9068 KB |
Output is correct |
28 |
Correct |
28 ms |
9032 KB |
Output is correct |
29 |
Correct |
29 ms |
9004 KB |
Output is correct |
30 |
Correct |
34 ms |
9044 KB |
Output is correct |
31 |
Correct |
33 ms |
9072 KB |
Output is correct |
32 |
Correct |
34 ms |
9008 KB |
Output is correct |
33 |
Correct |
375 ms |
102472 KB |
Output is correct |
34 |
Correct |
390 ms |
102496 KB |
Output is correct |
35 |
Correct |
417 ms |
102424 KB |
Output is correct |
36 |
Correct |
535 ms |
102492 KB |
Output is correct |
37 |
Correct |
541 ms |
102468 KB |
Output is correct |
38 |
Correct |
542 ms |
102468 KB |
Output is correct |
39 |
Correct |
1268 ms |
102500 KB |
Output is correct |
40 |
Correct |
1277 ms |
102448 KB |
Output is correct |
41 |
Correct |
1236 ms |
102512 KB |
Output is correct |
42 |
Correct |
461 ms |
102344 KB |
Output is correct |
43 |
Correct |
395 ms |
102480 KB |
Output is correct |
44 |
Correct |
392 ms |
102468 KB |
Output is correct |
45 |
Correct |
443 ms |
102492 KB |
Output is correct |
46 |
Correct |
386 ms |
102476 KB |
Output is correct |
47 |
Correct |
389 ms |
102528 KB |
Output is correct |
48 |
Correct |
395 ms |
102420 KB |
Output is correct |
49 |
Correct |
396 ms |
102468 KB |
Output is correct |
50 |
Correct |
392 ms |
102468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
304 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
300 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
332 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
332 KB |
Output is correct |
16 |
Correct |
3 ms |
972 KB |
Output is correct |
17 |
Correct |
3 ms |
972 KB |
Output is correct |
18 |
Correct |
3 ms |
972 KB |
Output is correct |
19 |
Correct |
13 ms |
4556 KB |
Output is correct |
20 |
Correct |
13 ms |
4556 KB |
Output is correct |
21 |
Correct |
14 ms |
4476 KB |
Output is correct |
22 |
Correct |
20 ms |
4428 KB |
Output is correct |
23 |
Correct |
17 ms |
4556 KB |
Output is correct |
24 |
Correct |
15 ms |
4556 KB |
Output is correct |
25 |
Correct |
15 ms |
4468 KB |
Output is correct |
26 |
Correct |
15 ms |
4428 KB |
Output is correct |
27 |
Correct |
1372 ms |
329204 KB |
Output is correct |
28 |
Correct |
1402 ms |
329440 KB |
Output is correct |
29 |
Correct |
1422 ms |
329128 KB |
Output is correct |
30 |
Correct |
1354 ms |
329492 KB |
Output is correct |
31 |
Correct |
1383 ms |
329340 KB |
Output is correct |
32 |
Correct |
1528 ms |
329388 KB |
Output is correct |
33 |
Correct |
1401 ms |
329380 KB |
Output is correct |
34 |
Correct |
1415 ms |
329252 KB |
Output is correct |
35 |
Correct |
1 ms |
332 KB |
Output is correct |
36 |
Correct |
592 ms |
102684 KB |
Output is correct |
37 |
Correct |
2273 ms |
329028 KB |
Output is correct |
38 |
Correct |
2259 ms |
329404 KB |
Output is correct |
39 |
Correct |
2153 ms |
319940 KB |
Output is correct |
40 |
Correct |
868 ms |
165316 KB |
Output is correct |
41 |
Correct |
375 ms |
83828 KB |
Output is correct |
42 |
Correct |
54 ms |
15976 KB |
Output is correct |
43 |
Correct |
2230 ms |
329288 KB |
Output is correct |
44 |
Correct |
2220 ms |
329448 KB |
Output is correct |
45 |
Correct |
2078 ms |
329060 KB |
Output is correct |
46 |
Correct |
1884 ms |
329256 KB |
Output is correct |
47 |
Correct |
1711 ms |
328872 KB |
Output is correct |
48 |
Correct |
1820 ms |
329456 KB |
Output is correct |
49 |
Correct |
1832 ms |
329096 KB |
Output is correct |
50 |
Correct |
1595 ms |
328272 KB |
Output is correct |
51 |
Correct |
28 ms |
9068 KB |
Output is correct |
52 |
Correct |
28 ms |
9032 KB |
Output is correct |
53 |
Correct |
29 ms |
9004 KB |
Output is correct |
54 |
Correct |
34 ms |
9044 KB |
Output is correct |
55 |
Correct |
33 ms |
9072 KB |
Output is correct |
56 |
Correct |
34 ms |
9008 KB |
Output is correct |
57 |
Correct |
375 ms |
102472 KB |
Output is correct |
58 |
Correct |
390 ms |
102496 KB |
Output is correct |
59 |
Correct |
417 ms |
102424 KB |
Output is correct |
60 |
Correct |
535 ms |
102492 KB |
Output is correct |
61 |
Correct |
541 ms |
102468 KB |
Output is correct |
62 |
Correct |
542 ms |
102468 KB |
Output is correct |
63 |
Correct |
1268 ms |
102500 KB |
Output is correct |
64 |
Correct |
1277 ms |
102448 KB |
Output is correct |
65 |
Correct |
1236 ms |
102512 KB |
Output is correct |
66 |
Correct |
461 ms |
102344 KB |
Output is correct |
67 |
Correct |
395 ms |
102480 KB |
Output is correct |
68 |
Correct |
392 ms |
102468 KB |
Output is correct |
69 |
Correct |
443 ms |
102492 KB |
Output is correct |
70 |
Correct |
386 ms |
102476 KB |
Output is correct |
71 |
Correct |
389 ms |
102528 KB |
Output is correct |
72 |
Correct |
395 ms |
102420 KB |
Output is correct |
73 |
Correct |
396 ms |
102468 KB |
Output is correct |
74 |
Correct |
392 ms |
102468 KB |
Output is correct |
75 |
Correct |
1488 ms |
328716 KB |
Output is correct |
76 |
Correct |
1455 ms |
329188 KB |
Output is correct |
77 |
Correct |
1422 ms |
329192 KB |
Output is correct |
78 |
Correct |
1400 ms |
328788 KB |
Output is correct |
79 |
Correct |
1719 ms |
328900 KB |
Output is correct |
80 |
Correct |
1415 ms |
328696 KB |
Output is correct |
81 |
Correct |
2156 ms |
328900 KB |
Output is correct |
82 |
Correct |
2087 ms |
328792 KB |
Output is correct |
83 |
Correct |
2093 ms |
328704 KB |
Output is correct |
84 |
Correct |
2365 ms |
328836 KB |
Output is correct |
85 |
Correct |
2151 ms |
328772 KB |
Output is correct |
86 |
Correct |
2086 ms |
328824 KB |
Output is correct |
87 |
Execution timed out |
3099 ms |
328648 KB |
Time limit exceeded |
88 |
Halted |
0 ms |
0 KB |
- |