oj.uz

Submission #397234

# Submission time Handle Problem Language Result Execution time Memory
397234 2021-05-01T18:16:18 Z parsabahrami Circle selection (APIO18_circle_selection) C++17
37 / 100
 3000 ms 326716 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 + 10, 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) {
            auto it = this->lower_bound({yl, -1e9});
            while (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:64:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:66:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   66 |         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 5 ms 972 KB Output is correct
17 Correct 4 ms 976 KB Output is correct
18 Correct 5 ms 972 KB Output is correct
19 Correct 22 ms 4300 KB Output is correct
20 Correct 22 ms 4300 KB Output is correct
21 Correct 23 ms 4332 KB Output is correct
22 Correct 29 ms 4300 KB Output is correct
23 Correct 30 ms 4300 KB Output is correct
24 Correct 27 ms 4400 KB Output is correct
25 Correct 27 ms 4304 KB Output is correct
26 Correct 29 ms 4388 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3107 ms 326236 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 2084 ms 102420 KB Output is correct
3 Execution timed out 3110 ms 326716 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 3104 ms 325988 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 5 ms 972 KB Output is correct
17 Correct 4 ms 976 KB Output is correct
18 Correct 5 ms 972 KB Output is correct
19 Correct 22 ms 4300 KB Output is correct
20 Correct 22 ms 4300 KB Output is correct
21 Correct 23 ms 4332 KB Output is correct
22 Correct 29 ms 4300 KB Output is correct
23 Correct 30 ms 4300 KB Output is correct
24 Correct 27 ms 4400 KB Output is correct
25 Correct 27 ms 4304 KB Output is correct
26 Correct 29 ms 4388 KB Output is correct
27 Correct 75 ms 8920 KB Output is correct
28 Correct 58 ms 8892 KB Output is correct
29 Correct 58 ms 8848 KB Output is correct
30 Correct 80 ms 8912 KB Output is correct
31 Correct 76 ms 8908 KB Output is correct
32 Correct 75 ms 8940 KB Output is correct
33 Correct 1197 ms 102300 KB Output is correct
34 Correct 1220 ms 102304 KB Output is correct
35 Correct 1258 ms 102320 KB Output is correct
36 Correct 1967 ms 102300 KB Output is correct
37 Correct 2025 ms 102308 KB Output is correct
38 Correct 1976 ms 102276 KB Output is correct
39 Correct 2399 ms 102308 KB Output is correct
40 Correct 2441 ms 102340 KB Output is correct
41 Correct 2399 ms 102336 KB Output is correct
42 Correct 1562 ms 102176 KB Output is correct
43 Correct 1625 ms 102304 KB Output is correct
44 Correct 1625 ms 102304 KB Output is correct
45 Correct 1623 ms 102300 KB Output is correct
46 Correct 1654 ms 102484 KB Output is correct
47 Correct 1596 ms 102368 KB Output is correct
48 Correct 1618 ms 102304 KB Output is correct
49 Correct 1619 ms 102308 KB Output is correct
50 Correct 1626 ms 102300 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 5 ms 972 KB Output is correct
17 Correct 4 ms 976 KB Output is correct
18 Correct 5 ms 972 KB Output is correct
19 Correct 22 ms 4300 KB Output is correct
20 Correct 22 ms 4300 KB Output is correct
21 Correct 23 ms 4332 KB Output is correct
22 Correct 29 ms 4300 KB Output is correct
23 Correct 30 ms 4300 KB Output is correct
24 Correct 27 ms 4400 KB Output is correct
25 Correct 27 ms 4304 KB Output is correct
26 Correct 29 ms 4388 KB Output is correct
27 Execution timed out 3107 ms 326236 KB Time limit exceeded
28 Halted 0 ms 0 KB -