oj.uz

Submission #397551

# Submission time Handle Problem Language Result Execution time Memory
397551 2021-05-02T11:16:20 Z AriaH Circle selection (APIO18_circle_selection) C++11
100 / 100
 2423 ms 397608 KB 
/* There's someone in my head but it's not me */ 
#include <bits/stdc++.h>
 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx")
 
using namespace std;
 
typedef long long int ll;
typedef pair<int, int> pii;
 
#define all(x) x.begin(), x.end()
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second
#define lc                          i << 1
#define rc                          lc | 1
 
const int N = 3e5 + 4, MOD = 1e9 + 7;
int n, X[N], Y[N], R[N], ord[N], ret[N], id[N]; ll base[N];
set<pii> seg[N << 1]; vector <ll> cm;
vector<pii> vec[N << 1];
 
bool cmp(int i, int j) {
	if (R[i] == R[j]) return i < j;
    return R[i] > R[j];
}
 
int intersect(int i, int j) {
    return (base[i] + base[j] + 2ll * (1ll * X[i] * X[j] + 1ll * Y[i] * Y[j] + 1ll * R[i] * R[j])) >= 0;
}
 
int lwr(ll x) {
    return lower_bound(all(cm), x) - cm.begin();
}
 
void add(int pos, pii x) {
    pos += n;
    vec[pos].push_back(x);
}
 
void get(int ql, int qr, ll yl, ll yr, int p) {
    ql += n, qr += n + 1;
    while (qr - ql > 0) {
        if (ql & 1) {
            for (auto it = seg[ql].lower_bound({yl, -1e9}); it != seg[ql].end() && it->F <= yr; ) {
                if (ret[it->S]) it = seg[ql].erase(it);
                else if (intersect(p, it->S)) ret[it->S] = p, it = seg[ql].erase(it);
                else it++;
            }
            ql++;
        } 
        if (qr & 1) {
            qr--;
            for (auto it = seg[qr].lower_bound({yl, -1e9}); it != seg[qr].end() && it->F <= yr; ) {
                if (ret[it->S]) it = seg[qr].erase(it);
                else if (intersect(p, it->S)) ret[it->S] = p, it = seg[qr].erase(it);
                else it++;
            }
        }
        qr >>= 1, ql >>= 1;
    }
}
 
int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) 
        scanf("%d%d%d", &X[i], &Y[i], &R[i]), base[i] = 1ll * R[i] * R[i] - 1ll * X[i] * X[i] - 1ll * Y[i] * Y[i], cm.push_back(X[i]), ord[i] = i;
    sort(ord + 1, ord + n + 1, cmp);
    sort(all(cm));
    cm.resize(unique(all(cm)) - cm.begin());
    for(int i = 1; i <= n; i ++) {
	    int I = ord[i];
	    add(lwr(X[I]) + 1, make_pair(Y[I], I));
    }
    for (int i = n + 1; i <= 2 * n + 2; i++) {
	    sort(all(vec[i]));
    }
    for(int i = n; i >= 1; i--) {
	    merge(all(vec[lc]), all(vec[rc]), back_inserter(vec[i]));
    }
    for (int i = 0; i <= 2 * n + 2; i++) {
	    seg[i] = set<pii>(vec[i].begin(), vec[i].end());
    }
    for (int _ = 1; _ <= n; _++) {
        int i = ord[_];
        if (ret[i]) continue;
        get(lwr(X[i] - 2ll * R[i]) + 1, lwr(X[i] + 2ll * R[i] + 1), Y[i] - 2ll * R[i], Y[i] + 2ll * R[i], i);
    }
    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: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]), base[i] = 1ll * R[i] * R[i] - 1ll * X[i] * X[i] - 1ll * Y[i] * Y[i], cm.push_back(X[i]), ord[i] = i;
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 42572 KB Output is correct
2 Correct 22 ms 42552 KB Output is correct
3 Correct 23 ms 42564 KB Output is correct
4 Correct 23 ms 42572 KB Output is correct
5 Correct 22 ms 42496 KB Output is correct
6 Correct 22 ms 42576 KB Output is correct
7 Correct 23 ms 42572 KB Output is correct
8 Correct 23 ms 42556 KB Output is correct
9 Correct 23 ms 42584 KB Output is correct
10 Correct 22 ms 42576 KB Output is correct
11 Correct 23 ms 42620 KB Output is correct
12 Correct 24 ms 42604 KB Output is correct
13 Correct 22 ms 42576 KB Output is correct
14 Correct 23 ms 42560 KB Output is correct
15 Correct 22 ms 42572 KB Output is correct
16 Correct 24 ms 43248 KB Output is correct
17 Correct 24 ms 43208 KB Output is correct
18 Correct 25 ms 43280 KB Output is correct
19 Correct 34 ms 46816 KB Output is correct
20 Correct 34 ms 46812 KB Output is correct
21 Correct 34 ms 46812 KB Output is correct
22 Correct 35 ms 46720 KB Output is correct
23 Correct 37 ms 46804 KB Output is correct
24 Correct 35 ms 46716 KB Output is correct
25 Correct 35 ms 46732 KB Output is correct
26 Correct 35 ms 46672 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1055 ms 386116 KB Output is correct
2 Correct 1060 ms 385776 KB Output is correct
3 Correct 1054 ms 386332 KB Output is correct
4 Correct 1027 ms 385392 KB Output is correct
5 Correct 1062 ms 384444 KB Output is correct
6 Correct 1213 ms 394396 KB Output is correct
7 Correct 1125 ms 397328 KB Output is correct
8 Correct 1138 ms 397608 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 42480 KB Output is correct
2 Correct 447 ms 148568 KB Output is correct
3 Correct 1501 ms 385116 KB Output is correct
4 Correct 1497 ms 385180 KB Output is correct
5 Correct 1514 ms 375568 KB Output is correct
6 Correct 685 ms 213716 KB Output is correct
7 Correct 333 ms 128636 KB Output is correct
8 Correct 70 ms 58276 KB Output is correct
9 Correct 1521 ms 385748 KB Output is correct
10 Correct 1586 ms 385840 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1345 ms 386460 KB Output is correct
2 Correct 1175 ms 389944 KB Output is correct
3 Correct 1208 ms 385400 KB Output is correct
4 Correct 1234 ms 385828 KB Output is correct
5 Correct 1238 ms 385536 KB Output is correct
6 Correct 1110 ms 386876 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 42572 KB Output is correct
2 Correct 22 ms 42552 KB Output is correct
3 Correct 23 ms 42564 KB Output is correct
4 Correct 23 ms 42572 KB Output is correct
5 Correct 22 ms 42496 KB Output is correct
6 Correct 22 ms 42576 KB Output is correct
7 Correct 23 ms 42572 KB Output is correct
8 Correct 23 ms 42556 KB Output is correct
9 Correct 23 ms 42584 KB Output is correct
10 Correct 22 ms 42576 KB Output is correct
11 Correct 23 ms 42620 KB Output is correct
12 Correct 24 ms 42604 KB Output is correct
13 Correct 22 ms 42576 KB Output is correct
14 Correct 23 ms 42560 KB Output is correct
15 Correct 22 ms 42572 KB Output is correct
16 Correct 24 ms 43248 KB Output is correct
17 Correct 24 ms 43208 KB Output is correct
18 Correct 25 ms 43280 KB Output is correct
19 Correct 34 ms 46816 KB Output is correct
20 Correct 34 ms 46812 KB Output is correct
21 Correct 34 ms 46812 KB Output is correct
22 Correct 35 ms 46720 KB Output is correct
23 Correct 37 ms 46804 KB Output is correct
24 Correct 35 ms 46716 KB Output is correct
25 Correct 35 ms 46732 KB Output is correct
26 Correct 35 ms 46672 KB Output is correct
27 Correct 47 ms 51544 KB Output is correct
28 Correct 47 ms 51532 KB Output is correct
29 Correct 48 ms 51476 KB Output is correct
30 Correct 51 ms 51608 KB Output is correct
31 Correct 51 ms 51544 KB Output is correct
32 Correct 52 ms 51548 KB Output is correct
33 Correct 348 ms 149212 KB Output is correct
34 Correct 323 ms 148908 KB Output is correct
35 Correct 329 ms 148964 KB Output is correct
36 Correct 404 ms 148892 KB Output is correct
37 Correct 407 ms 148788 KB Output is correct
38 Correct 411 ms 148916 KB Output is correct
39 Correct 501 ms 142264 KB Output is correct
40 Correct 486 ms 142148 KB Output is correct
41 Correct 489 ms 142240 KB Output is correct
42 Correct 327 ms 141956 KB Output is correct
43 Correct 349 ms 148688 KB Output is correct
44 Correct 355 ms 148836 KB Output is correct
45 Correct 350 ms 148716 KB Output is correct
46 Correct 368 ms 148852 KB Output is correct
47 Correct 351 ms 148804 KB Output is correct
48 Correct 360 ms 148780 KB Output is correct
49 Correct 347 ms 148772 KB Output is correct
50 Correct 350 ms 148660 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 42572 KB Output is correct
2 Correct 22 ms 42552 KB Output is correct
3 Correct 23 ms 42564 KB Output is correct
4 Correct 23 ms 42572 KB Output is correct
5 Correct 22 ms 42496 KB Output is correct
6 Correct 22 ms 42576 KB Output is correct
7 Correct 23 ms 42572 KB Output is correct
8 Correct 23 ms 42556 KB Output is correct
9 Correct 23 ms 42584 KB Output is correct
10 Correct 22 ms 42576 KB Output is correct
11 Correct 23 ms 42620 KB Output is correct
12 Correct 24 ms 42604 KB Output is correct
13 Correct 22 ms 42576 KB Output is correct
14 Correct 23 ms 42560 KB Output is correct
15 Correct 22 ms 42572 KB Output is correct
16 Correct 24 ms 43248 KB Output is correct
17 Correct 24 ms 43208 KB Output is correct
18 Correct 25 ms 43280 KB Output is correct
19 Correct 34 ms 46816 KB Output is correct
20 Correct 34 ms 46812 KB Output is correct
21 Correct 34 ms 46812 KB Output is correct
22 Correct 35 ms 46720 KB Output is correct
23 Correct 37 ms 46804 KB Output is correct
24 Correct 35 ms 46716 KB Output is correct
25 Correct 35 ms 46732 KB Output is correct
26 Correct 35 ms 46672 KB Output is correct
27 Correct 1055 ms 386116 KB Output is correct
28 Correct 1060 ms 385776 KB Output is correct
29 Correct 1054 ms 386332 KB Output is correct
30 Correct 1027 ms 385392 KB Output is correct
31 Correct 1062 ms 384444 KB Output is correct
32 Correct 1213 ms 394396 KB Output is correct
33 Correct 1125 ms 397328 KB Output is correct
34 Correct 1138 ms 397608 KB Output is correct
35 Correct 29 ms 42480 KB Output is correct
36 Correct 447 ms 148568 KB Output is correct
37 Correct 1501 ms 385116 KB Output is correct
38 Correct 1497 ms 385180 KB Output is correct
39 Correct 1514 ms 375568 KB Output is correct
40 Correct 685 ms 213716 KB Output is correct
41 Correct 333 ms 128636 KB Output is correct
42 Correct 70 ms 58276 KB Output is correct
43 Correct 1521 ms 385748 KB Output is correct
44 Correct 1586 ms 385840 KB Output is correct
45 Correct 1345 ms 386460 KB Output is correct
46 Correct 1175 ms 389944 KB Output is correct
47 Correct 1208 ms 385400 KB Output is correct
48 Correct 1234 ms 385828 KB Output is correct
49 Correct 1238 ms 385536 KB Output is correct
50 Correct 1110 ms 386876 KB Output is correct
51 Correct 47 ms 51544 KB Output is correct
52 Correct 47 ms 51532 KB Output is correct
53 Correct 48 ms 51476 KB Output is correct
54 Correct 51 ms 51608 KB Output is correct
55 Correct 51 ms 51544 KB Output is correct
56 Correct 52 ms 51548 KB Output is correct
57 Correct 348 ms 149212 KB Output is correct
58 Correct 323 ms 148908 KB Output is correct
59 Correct 329 ms 148964 KB Output is correct
60 Correct 404 ms 148892 KB Output is correct
61 Correct 407 ms 148788 KB Output is correct
62 Correct 411 ms 148916 KB Output is correct
63 Correct 501 ms 142264 KB Output is correct
64 Correct 486 ms 142148 KB Output is correct
65 Correct 489 ms 142240 KB Output is correct
66 Correct 327 ms 141956 KB Output is correct
67 Correct 349 ms 148688 KB Output is correct
68 Correct 355 ms 148836 KB Output is correct
69 Correct 350 ms 148716 KB Output is correct
70 Correct 368 ms 148852 KB Output is correct
71 Correct 351 ms 148804 KB Output is correct
72 Correct 360 ms 148780 KB Output is correct
73 Correct 347 ms 148772 KB Output is correct
74 Correct 350 ms 148660 KB Output is correct
75 Correct 1115 ms 385624 KB Output is correct
76 Correct 1088 ms 386568 KB Output is correct
77 Correct 1082 ms 391980 KB Output is correct
78 Correct 1119 ms 386032 KB Output is correct
79 Correct 1152 ms 385832 KB Output is correct
80 Correct 1082 ms 385828 KB Output is correct
81 Correct 1502 ms 386384 KB Output is correct
82 Correct 1425 ms 385148 KB Output is correct
83 Correct 1429 ms 385440 KB Output is correct
84 Correct 1612 ms 386940 KB Output is correct
85 Correct 1459 ms 385452 KB Output is correct
86 Correct 1454 ms 385004 KB Output is correct
87 Correct 2164 ms 393092 KB Output is correct
88 Correct 2087 ms 372552 KB Output is correct
89 Correct 2153 ms 372580 KB Output is correct
90 Correct 2145 ms 372708 KB Output is correct
91 Correct 2090 ms 372756 KB Output is correct
92 Correct 2164 ms 372520 KB Output is correct
93 Correct 1250 ms 386488 KB Output is correct
94 Correct 1801 ms 370192 KB Output is correct
95 Correct 1253 ms 386380 KB Output is correct
96 Correct 1297 ms 388212 KB Output is correct
97 Correct 1994 ms 370596 KB Output is correct
98 Correct 1253 ms 394664 KB Output is correct
99 Correct 1313 ms 384992 KB Output is correct
100 Correct 1272 ms 384460 KB Output is correct
101 Correct 1398 ms 396616 KB Output is correct
102 Correct 1277 ms 387196 KB Output is correct
103 Correct 2423 ms 371544 KB Output is correct
104 Correct 1262 ms 384720 KB Output is correct
105 Correct 1070 ms 371788 KB Output is correct
106 Correct 1208 ms 385500 KB Output is correct
107 Correct 1168 ms 385320 KB Output is correct
108 Correct 1207 ms 385544 KB Output is correct
109 Correct 1239 ms 385448 KB Output is correct
110 Correct 1202 ms 385104 KB Output is correct
111 Correct 1208 ms 385488 KB Output is correct
112 Correct 1205 ms 385288 KB Output is correct
113 Correct 1235 ms 385180 KB Output is correct
114 Correct 1178 ms 385260 KB Output is correct
115 Correct 1212 ms 385192 KB Output is correct
116 Correct 1164 ms 384392 KB Output is correct