oj.uz

Submission #397467

# Submission time Handle Problem Language Result Execution time Memory
397467 2021-05-02T09:34:42 Z parsabahrami Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 332612 KB 
/* 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]; ll base[N]; vector<int> ids;

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;
}

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]), base[i] = 1ll * R[i] * R[i] - 1ll * X[i] * X[i] - 1ll * Y[i] * Y[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:65:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   65 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:67:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   67 |         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];
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory 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 332 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 332 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 336 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 4 ms 972 KB Output is correct
19 Correct 13 ms 4424 KB Output is correct
20 Correct 13 ms 4428 KB Output is correct
21 Correct 17 ms 4428 KB Output is correct
22 Correct 17 ms 4548 KB Output is correct
23 Correct 17 ms 4452 KB Output is correct
24 Correct 15 ms 4404 KB Output is correct
25 Correct 14 ms 4436 KB Output is correct
26 Correct 15 ms 4448 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1367 ms 331152 KB Output is correct
2 Correct 1389 ms 331160 KB Output is correct
3 Correct 1362 ms 330856 KB Output is correct
4 Correct 1480 ms 331540 KB Output is correct
5 Correct 1592 ms 331268 KB Output is correct
6 Correct 1556 ms 331404 KB Output is correct
7 Correct 1403 ms 331612 KB Output is correct
8 Correct 1454 ms 332568 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 612 ms 104108 KB Output is correct
3 Correct 2292 ms 332032 KB Output is correct
4 Correct 2286 ms 332548 KB Output is correct
5 Correct 2153 ms 323012 KB Output is correct
6 Correct 880 ms 167308 KB Output is correct
7 Correct 386 ms 85384 KB Output is correct
8 Correct 55 ms 16084 KB Output is correct
9 Correct 2216 ms 332612 KB Output is correct
10 Correct 2216 ms 332584 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2065 ms 331616 KB Output is correct
2 Correct 1770 ms 332524 KB Output is correct
3 Correct 1682 ms 332084 KB Output is correct
4 Correct 1824 ms 332576 KB Output is correct
5 Correct 1795 ms 332424 KB Output is correct
6 Correct 1567 ms 331776 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory 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 332 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 332 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 336 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 4 ms 972 KB Output is correct
19 Correct 13 ms 4424 KB Output is correct
20 Correct 13 ms 4428 KB Output is correct
21 Correct 17 ms 4428 KB Output is correct
22 Correct 17 ms 4548 KB Output is correct
23 Correct 17 ms 4452 KB Output is correct
24 Correct 15 ms 4404 KB Output is correct
25 Correct 14 ms 4436 KB Output is correct
26 Correct 15 ms 4448 KB Output is correct
27 Correct 28 ms 9272 KB Output is correct
28 Correct 28 ms 9312 KB Output is correct
29 Correct 28 ms 9248 KB Output is correct
30 Correct 35 ms 9292 KB Output is correct
31 Correct 33 ms 9284 KB Output is correct
32 Correct 33 ms 9256 KB Output is correct
33 Correct 375 ms 103972 KB Output is correct
34 Correct 377 ms 103848 KB Output is correct
35 Correct 410 ms 103820 KB Output is correct
36 Correct 525 ms 103832 KB Output is correct
37 Correct 530 ms 104024 KB Output is correct
38 Correct 555 ms 103856 KB Output is correct
39 Correct 1256 ms 103876 KB Output is correct
40 Correct 1281 ms 104008 KB Output is correct
41 Correct 1303 ms 103928 KB Output is correct
42 Correct 472 ms 103644 KB Output is correct
43 Correct 381 ms 103864 KB Output is correct
44 Correct 388 ms 103952 KB Output is correct
45 Correct 390 ms 103892 KB Output is correct
46 Correct 387 ms 103808 KB Output is correct
47 Correct 397 ms 103876 KB Output is correct
48 Correct 386 ms 103928 KB Output is correct
49 Correct 399 ms 103856 KB Output is correct
50 Correct 384 ms 103900 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory 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 332 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 332 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 336 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 4 ms 972 KB Output is correct
19 Correct 13 ms 4424 KB Output is correct
20 Correct 13 ms 4428 KB Output is correct
21 Correct 17 ms 4428 KB Output is correct
22 Correct 17 ms 4548 KB Output is correct
23 Correct 17 ms 4452 KB Output is correct
24 Correct 15 ms 4404 KB Output is correct
25 Correct 14 ms 4436 KB Output is correct
26 Correct 15 ms 4448 KB Output is correct
27 Correct 1367 ms 331152 KB Output is correct
28 Correct 1389 ms 331160 KB Output is correct
29 Correct 1362 ms 330856 KB Output is correct
30 Correct 1480 ms 331540 KB Output is correct
31 Correct 1592 ms 331268 KB Output is correct
32 Correct 1556 ms 331404 KB Output is correct
33 Correct 1403 ms 331612 KB Output is correct
34 Correct 1454 ms 332568 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 612 ms 104108 KB Output is correct
37 Correct 2292 ms 332032 KB Output is correct
38 Correct 2286 ms 332548 KB Output is correct
39 Correct 2153 ms 323012 KB Output is correct
40 Correct 880 ms 167308 KB Output is correct
41 Correct 386 ms 85384 KB Output is correct
42 Correct 55 ms 16084 KB Output is correct
43 Correct 2216 ms 332612 KB Output is correct
44 Correct 2216 ms 332584 KB Output is correct
45 Correct 2065 ms 331616 KB Output is correct
46 Correct 1770 ms 332524 KB Output is correct
47 Correct 1682 ms 332084 KB Output is correct
48 Correct 1824 ms 332576 KB Output is correct
49 Correct 1795 ms 332424 KB Output is correct
50 Correct 1567 ms 331776 KB Output is correct
51 Correct 28 ms 9272 KB Output is correct
52 Correct 28 ms 9312 KB Output is correct
53 Correct 28 ms 9248 KB Output is correct
54 Correct 35 ms 9292 KB Output is correct
55 Correct 33 ms 9284 KB Output is correct
56 Correct 33 ms 9256 KB Output is correct
57 Correct 375 ms 103972 KB Output is correct
58 Correct 377 ms 103848 KB Output is correct
59 Correct 410 ms 103820 KB Output is correct
60 Correct 525 ms 103832 KB Output is correct
61 Correct 530 ms 104024 KB Output is correct
62 Correct 555 ms 103856 KB Output is correct
63 Correct 1256 ms 103876 KB Output is correct
64 Correct 1281 ms 104008 KB Output is correct
65 Correct 1303 ms 103928 KB Output is correct
66 Correct 472 ms 103644 KB Output is correct
67 Correct 381 ms 103864 KB Output is correct
68 Correct 388 ms 103952 KB Output is correct
69 Correct 390 ms 103892 KB Output is correct
70 Correct 387 ms 103808 KB Output is correct
71 Correct 397 ms 103876 KB Output is correct
72 Correct 386 ms 103928 KB Output is correct
73 Correct 399 ms 103856 KB Output is correct
74 Correct 384 ms 103900 KB Output is correct
75 Correct 1524 ms 332188 KB Output is correct
76 Correct 1510 ms 332392 KB Output is correct
77 Correct 1403 ms 332396 KB Output is correct
78 Correct 1417 ms 332200 KB Output is correct
79 Correct 1682 ms 332292 KB Output is correct
80 Correct 1420 ms 332196 KB Output is correct
81 Correct 2334 ms 332276 KB Output is correct
82 Correct 2205 ms 332064 KB Output is correct
83 Correct 2177 ms 332080 KB Output is correct
84 Correct 2437 ms 332404 KB Output is correct
85 Correct 2195 ms 332472 KB Output is correct
86 Correct 2121 ms 332412 KB Output is correct
87 Execution timed out 3091 ms 330444 KB Time limit exceeded
88 Halted 0 ms 0 KB -