oj.uz

Submission #397550

# Submission time Handle Problem Language Result Execution time Memory
397550 2021-05-02T11:13:16 Z parsabahrami Circle selection (APIO18_circle_selection) C++17
100 / 100
 2423 ms 403440 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 25 ms 42476 KB Output is correct
2 Correct 26 ms 42504 KB Output is correct
3 Correct 22 ms 42592 KB Output is correct
4 Correct 22 ms 42516 KB Output is correct
5 Correct 23 ms 42584 KB Output is correct
6 Correct 32 ms 42656 KB Output is correct
7 Correct 24 ms 42656 KB Output is correct
8 Correct 23 ms 42580 KB Output is correct
9 Correct 23 ms 42572 KB Output is correct
10 Correct 23 ms 42516 KB Output is correct
11 Correct 23 ms 42564 KB Output is correct
12 Correct 24 ms 42616 KB Output is correct
13 Correct 24 ms 42572 KB Output is correct
14 Correct 23 ms 42656 KB Output is correct
15 Correct 24 ms 42636 KB Output is correct
16 Correct 25 ms 43276 KB Output is correct
17 Correct 25 ms 43212 KB Output is correct
18 Correct 25 ms 43288 KB Output is correct
19 Correct 35 ms 46608 KB Output is correct
20 Correct 34 ms 46660 KB Output is correct
21 Correct 34 ms 46608 KB Output is correct
22 Correct 35 ms 46636 KB Output is correct
23 Correct 38 ms 46664 KB Output is correct
24 Correct 36 ms 46584 KB Output is correct
25 Correct 35 ms 46660 KB Output is correct
26 Correct 35 ms 46640 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1055 ms 385096 KB Output is correct
2 Correct 1050 ms 384632 KB Output is correct
3 Correct 1053 ms 385024 KB Output is correct
4 Correct 1059 ms 384276 KB Output is correct
5 Correct 1092 ms 383512 KB Output is correct
6 Correct 1238 ms 393440 KB Output is correct
7 Correct 1137 ms 396532 KB Output is correct
8 Correct 1148 ms 396552 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 42572 KB Output is correct
2 Correct 448 ms 147652 KB Output is correct
3 Correct 1538 ms 384168 KB Output is correct
4 Correct 1517 ms 383936 KB Output is correct
5 Correct 1593 ms 374400 KB Output is correct
6 Correct 687 ms 212608 KB Output is correct
7 Correct 318 ms 127804 KB Output is correct
8 Correct 74 ms 58020 KB Output is correct
9 Correct 1569 ms 384600 KB Output is correct
10 Correct 1602 ms 384680 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1379 ms 385328 KB Output is correct
2 Correct 1192 ms 388752 KB Output is correct
3 Correct 1221 ms 384368 KB Output is correct
4 Correct 1238 ms 384632 KB Output is correct
5 Correct 1308 ms 384404 KB Output is correct
6 Correct 1125 ms 385832 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 42476 KB Output is correct
2 Correct 26 ms 42504 KB Output is correct
3 Correct 22 ms 42592 KB Output is correct
4 Correct 22 ms 42516 KB Output is correct
5 Correct 23 ms 42584 KB Output is correct
6 Correct 32 ms 42656 KB Output is correct
7 Correct 24 ms 42656 KB Output is correct
8 Correct 23 ms 42580 KB Output is correct
9 Correct 23 ms 42572 KB Output is correct
10 Correct 23 ms 42516 KB Output is correct
11 Correct 23 ms 42564 KB Output is correct
12 Correct 24 ms 42616 KB Output is correct
13 Correct 24 ms 42572 KB Output is correct
14 Correct 23 ms 42656 KB Output is correct
15 Correct 24 ms 42636 KB Output is correct
16 Correct 25 ms 43276 KB Output is correct
17 Correct 25 ms 43212 KB Output is correct
18 Correct 25 ms 43288 KB Output is correct
19 Correct 35 ms 46608 KB Output is correct
20 Correct 34 ms 46660 KB Output is correct
21 Correct 34 ms 46608 KB Output is correct
22 Correct 35 ms 46636 KB Output is correct
23 Correct 38 ms 46664 KB Output is correct
24 Correct 36 ms 46584 KB Output is correct
25 Correct 35 ms 46660 KB Output is correct
26 Correct 35 ms 46640 KB Output is correct
27 Correct 48 ms 51208 KB Output is correct
28 Correct 50 ms 51244 KB Output is correct
29 Correct 49 ms 51156 KB Output is correct
30 Correct 57 ms 51332 KB Output is correct
31 Correct 51 ms 51236 KB Output is correct
32 Correct 51 ms 51216 KB Output is correct
33 Correct 320 ms 147992 KB Output is correct
34 Correct 330 ms 147852 KB Output is correct
35 Correct 327 ms 147892 KB Output is correct
36 Correct 410 ms 147740 KB Output is correct
37 Correct 397 ms 147748 KB Output is correct
38 Correct 413 ms 147768 KB Output is correct
39 Correct 488 ms 141368 KB Output is correct
40 Correct 479 ms 141408 KB Output is correct
41 Correct 496 ms 141456 KB Output is correct
42 Correct 317 ms 140724 KB Output is correct
43 Correct 350 ms 147652 KB Output is correct
44 Correct 346 ms 147748 KB Output is correct
45 Correct 360 ms 147576 KB Output is correct
46 Correct 353 ms 147660 KB Output is correct
47 Correct 345 ms 147600 KB Output is correct
48 Correct 352 ms 147592 KB Output is correct
49 Correct 354 ms 147736 KB Output is correct
50 Correct 344 ms 147512 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 42476 KB Output is correct
2 Correct 26 ms 42504 KB Output is correct
3 Correct 22 ms 42592 KB Output is correct
4 Correct 22 ms 42516 KB Output is correct
5 Correct 23 ms 42584 KB Output is correct
6 Correct 32 ms 42656 KB Output is correct
7 Correct 24 ms 42656 KB Output is correct
8 Correct 23 ms 42580 KB Output is correct
9 Correct 23 ms 42572 KB Output is correct
10 Correct 23 ms 42516 KB Output is correct
11 Correct 23 ms 42564 KB Output is correct
12 Correct 24 ms 42616 KB Output is correct
13 Correct 24 ms 42572 KB Output is correct
14 Correct 23 ms 42656 KB Output is correct
15 Correct 24 ms 42636 KB Output is correct
16 Correct 25 ms 43276 KB Output is correct
17 Correct 25 ms 43212 KB Output is correct
18 Correct 25 ms 43288 KB Output is correct
19 Correct 35 ms 46608 KB Output is correct
20 Correct 34 ms 46660 KB Output is correct
21 Correct 34 ms 46608 KB Output is correct
22 Correct 35 ms 46636 KB Output is correct
23 Correct 38 ms 46664 KB Output is correct
24 Correct 36 ms 46584 KB Output is correct
25 Correct 35 ms 46660 KB Output is correct
26 Correct 35 ms 46640 KB Output is correct
27 Correct 1055 ms 385096 KB Output is correct
28 Correct 1050 ms 384632 KB Output is correct
29 Correct 1053 ms 385024 KB Output is correct
30 Correct 1059 ms 384276 KB Output is correct
31 Correct 1092 ms 383512 KB Output is correct
32 Correct 1238 ms 393440 KB Output is correct
33 Correct 1137 ms 396532 KB Output is correct
34 Correct 1148 ms 396552 KB Output is correct
35 Correct 23 ms 42572 KB Output is correct
36 Correct 448 ms 147652 KB Output is correct
37 Correct 1538 ms 384168 KB Output is correct
38 Correct 1517 ms 383936 KB Output is correct
39 Correct 1593 ms 374400 KB Output is correct
40 Correct 687 ms 212608 KB Output is correct
41 Correct 318 ms 127804 KB Output is correct
42 Correct 74 ms 58020 KB Output is correct
43 Correct 1569 ms 384600 KB Output is correct
44 Correct 1602 ms 384680 KB Output is correct
45 Correct 1379 ms 385328 KB Output is correct
46 Correct 1192 ms 388752 KB Output is correct
47 Correct 1221 ms 384368 KB Output is correct
48 Correct 1238 ms 384632 KB Output is correct
49 Correct 1308 ms 384404 KB Output is correct
50 Correct 1125 ms 385832 KB Output is correct
51 Correct 48 ms 51208 KB Output is correct
52 Correct 50 ms 51244 KB Output is correct
53 Correct 49 ms 51156 KB Output is correct
54 Correct 57 ms 51332 KB Output is correct
55 Correct 51 ms 51236 KB Output is correct
56 Correct 51 ms 51216 KB Output is correct
57 Correct 320 ms 147992 KB Output is correct
58 Correct 330 ms 147852 KB Output is correct
59 Correct 327 ms 147892 KB Output is correct
60 Correct 410 ms 147740 KB Output is correct
61 Correct 397 ms 147748 KB Output is correct
62 Correct 413 ms 147768 KB Output is correct
63 Correct 488 ms 141368 KB Output is correct
64 Correct 479 ms 141408 KB Output is correct
65 Correct 496 ms 141456 KB Output is correct
66 Correct 317 ms 140724 KB Output is correct
67 Correct 350 ms 147652 KB Output is correct
68 Correct 346 ms 147748 KB Output is correct
69 Correct 360 ms 147576 KB Output is correct
70 Correct 353 ms 147660 KB Output is correct
71 Correct 345 ms 147600 KB Output is correct
72 Correct 352 ms 147592 KB Output is correct
73 Correct 354 ms 147736 KB Output is correct
74 Correct 344 ms 147512 KB Output is correct
75 Correct 1101 ms 384296 KB Output is correct
76 Correct 1087 ms 385436 KB Output is correct
77 Correct 1086 ms 390848 KB Output is correct
78 Correct 1066 ms 384808 KB Output is correct
79 Correct 1148 ms 384760 KB Output is correct
80 Correct 1070 ms 384732 KB Output is correct
81 Correct 1474 ms 385324 KB Output is correct
82 Correct 1434 ms 384116 KB Output is correct
83 Correct 1417 ms 384540 KB Output is correct
84 Correct 1608 ms 385972 KB Output is correct
85 Correct 1464 ms 384616 KB Output is correct
86 Correct 1419 ms 384084 KB Output is correct
87 Correct 2226 ms 392020 KB Output is correct
88 Correct 2085 ms 372264 KB Output is correct
89 Correct 2149 ms 375592 KB Output is correct
90 Correct 2120 ms 375692 KB Output is correct
91 Correct 2229 ms 375684 KB Output is correct
92 Correct 2131 ms 375516 KB Output is correct
93 Correct 1238 ms 393000 KB Output is correct
94 Correct 1826 ms 377432 KB Output is correct
95 Correct 1252 ms 393008 KB Output is correct
96 Correct 1294 ms 394872 KB Output is correct
97 Correct 2000 ms 376996 KB Output is correct
98 Correct 1263 ms 401680 KB Output is correct
99 Correct 1271 ms 391940 KB Output is correct
100 Correct 1238 ms 390944 KB Output is correct
101 Correct 1342 ms 403440 KB Output is correct
102 Correct 1315 ms 393716 KB Output is correct
103 Correct 2423 ms 378156 KB Output is correct
104 Correct 1267 ms 391020 KB Output is correct
105 Correct 1059 ms 376240 KB Output is correct
106 Correct 1202 ms 392724 KB Output is correct
107 Correct 1223 ms 392684 KB Output is correct
108 Correct 1216 ms 392892 KB Output is correct
109 Correct 1241 ms 392948 KB Output is correct
110 Correct 1213 ms 392708 KB Output is correct
111 Correct 1208 ms 392796 KB Output is correct
112 Correct 1212 ms 392816 KB Output is correct
113 Correct 1221 ms 392748 KB Output is correct
114 Correct 1195 ms 392552 KB Output is correct
115 Correct 1198 ms 392656 KB Output is correct
116 Correct 1176 ms 391896 KB Output is correct