oj.uz

Submission #397253

# Submission time Handle Problem Language Result Execution time Memory
397253 2021-05-01T19:02:11 Z parsabahrami Circle selection (APIO18_circle_selection) C++17
37 / 100
 3000 ms 327132 KB 
/* There's someone in my head but it's not me */ 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")

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 (intersect(id, x.S)) rt->remove(pos[x.S], 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: In function 'int main()':
circle_selection.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   63 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:65:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   65 |         scanf("%d%d%d", &X[i], &Y[i], &R[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 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 4 ms 972 KB Output is correct
17 Correct 4 ms 972 KB Output is correct
18 Correct 4 ms 972 KB Output is correct
19 Correct 23 ms 4396 KB Output is correct
20 Correct 22 ms 4416 KB Output is correct
21 Correct 23 ms 4300 KB Output is correct
22 Correct 29 ms 4336 KB Output is correct
23 Correct 37 ms 4392 KB Output is correct
24 Correct 29 ms 4300 KB Output is correct
25 Correct 28 ms 4392 KB Output is correct
26 Correct 28 ms 4300 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3063 ms 326196 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2110 ms 102688 KB Output is correct
3 Execution timed out 3075 ms 327132 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3084 ms 326172 KB Time limit exceeded
2 Halted 0 ms 0 KB -

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 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 4 ms 972 KB Output is correct
17 Correct 4 ms 972 KB Output is correct
18 Correct 4 ms 972 KB Output is correct
19 Correct 23 ms 4396 KB Output is correct
20 Correct 22 ms 4416 KB Output is correct
21 Correct 23 ms 4300 KB Output is correct
22 Correct 29 ms 4336 KB Output is correct
23 Correct 37 ms 4392 KB Output is correct
24 Correct 29 ms 4300 KB Output is correct
25 Correct 28 ms 4392 KB Output is correct
26 Correct 28 ms 4300 KB Output is correct
27 Correct 64 ms 9168 KB Output is correct
28 Correct 60 ms 9196 KB Output is correct
29 Correct 70 ms 9164 KB Output is correct
30 Correct 85 ms 9172 KB Output is correct
31 Correct 99 ms 9164 KB Output is correct
32 Correct 78 ms 9200 KB Output is correct
33 Correct 1225 ms 102548 KB Output is correct
34 Correct 1252 ms 102552 KB Output is correct
35 Correct 1309 ms 102552 KB Output is correct
36 Correct 2127 ms 102552 KB Output is correct
37 Correct 2017 ms 102552 KB Output is correct
38 Correct 2079 ms 102724 KB Output is correct
39 Correct 2385 ms 102584 KB Output is correct
40 Correct 2354 ms 102708 KB Output is correct
41 Correct 2368 ms 102592 KB Output is correct
42 Correct 1578 ms 102380 KB Output is correct
43 Correct 1641 ms 102552 KB Output is correct
44 Correct 1645 ms 102576 KB Output is correct
45 Correct 1649 ms 102556 KB Output is correct
46 Correct 1654 ms 102552 KB Output is correct
47 Correct 1639 ms 102632 KB Output is correct
48 Correct 1670 ms 102556 KB Output is correct
49 Correct 1666 ms 102552 KB Output is correct
50 Correct 1651 ms 102596 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 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 4 ms 972 KB Output is correct
17 Correct 4 ms 972 KB Output is correct
18 Correct 4 ms 972 KB Output is correct
19 Correct 23 ms 4396 KB Output is correct
20 Correct 22 ms 4416 KB Output is correct
21 Correct 23 ms 4300 KB Output is correct
22 Correct 29 ms 4336 KB Output is correct
23 Correct 37 ms 4392 KB Output is correct
24 Correct 29 ms 4300 KB Output is correct
25 Correct 28 ms 4392 KB Output is correct
26 Correct 28 ms 4300 KB Output is correct
27 Execution timed out 3063 ms 326196 KB Time limit exceeded
28 Halted 0 ms 0 KB -