oj.uz

Submission #397228

# Submission time Handle Problem Language Result Execution time Memory
397228 2021-05-01T18:02:19 Z parsabahrami Circle selection (APIO18_circle_selection) C++17
37 / 100
 3000 ms 327836 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 + 3, MOD = 1e9 + 7;
int n, X[N], Y[N], R[N], ord[N], xord[N], pos[N], ret[N]; vector<int> ids;
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 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) 
                ids.push_back(it->S), it++;
            return;
        }
        int md = (l + r) >> 1;
        lc->get(xl, xr, yl, yr, l, md), rc->get(xl, xr, yl, yr, md, r);
    }
    
};
node* seg;

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

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;
        ids = {};
        seg->get(X[i] - 2ll * R[i], X[i] + 2ll * R[i] + 1, Y[i] - 2ll * R[i], Y[i] + 2ll * R[i]);
        for (int &id : ids) {
            if (intersect(i, id)) ret[id] = i, seg->remove(pos[id], id);
        }
    }
    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:60:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   60 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:62:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   62 |         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 5 ms 972 KB Output is correct
19 Correct 29 ms 4428 KB Output is correct
20 Correct 23 ms 4428 KB Output is correct
21 Correct 23 ms 4452 KB Output is correct
22 Correct 28 ms 4384 KB Output is correct
23 Correct 29 ms 4392 KB Output is correct
24 Correct 27 ms 4300 KB Output is correct
25 Correct 27 ms 4412 KB Output is correct
26 Correct 27 ms 4392 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3081 ms 327836 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 2115 ms 102296 KB Output is correct
3 Execution timed out 3115 ms 326724 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 3108 ms 325920 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 5 ms 972 KB Output is correct
19 Correct 29 ms 4428 KB Output is correct
20 Correct 23 ms 4428 KB Output is correct
21 Correct 23 ms 4452 KB Output is correct
22 Correct 28 ms 4384 KB Output is correct
23 Correct 29 ms 4392 KB Output is correct
24 Correct 27 ms 4300 KB Output is correct
25 Correct 27 ms 4412 KB Output is correct
26 Correct 27 ms 4392 KB Output is correct
27 Correct 61 ms 8968 KB Output is correct
28 Correct 65 ms 9016 KB Output is correct
29 Correct 70 ms 9028 KB Output is correct
30 Correct 84 ms 8908 KB Output is correct
31 Correct 78 ms 9020 KB Output is correct
32 Correct 76 ms 8908 KB Output is correct
33 Correct 1233 ms 102940 KB Output is correct
34 Correct 1277 ms 102828 KB Output is correct
35 Correct 1302 ms 102800 KB Output is correct
36 Correct 2020 ms 102300 KB Output is correct
37 Correct 2057 ms 102300 KB Output is correct
38 Correct 2050 ms 102292 KB Output is correct
39 Correct 2116 ms 102852 KB Output is correct
40 Correct 1984 ms 102784 KB Output is correct
41 Correct 2138 ms 102760 KB Output is correct
42 Correct 1643 ms 102124 KB Output is correct
43 Correct 1626 ms 102368 KB Output is correct
44 Correct 1634 ms 102376 KB Output is correct
45 Correct 1644 ms 102300 KB Output is correct
46 Correct 1622 ms 102296 KB Output is correct
47 Correct 1614 ms 102340 KB Output is correct
48 Correct 1591 ms 102296 KB Output is correct
49 Correct 1616 ms 102412 KB Output is correct
50 Correct 1616 ms 102340 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 5 ms 972 KB Output is correct
19 Correct 29 ms 4428 KB Output is correct
20 Correct 23 ms 4428 KB Output is correct
21 Correct 23 ms 4452 KB Output is correct
22 Correct 28 ms 4384 KB Output is correct
23 Correct 29 ms 4392 KB Output is correct
24 Correct 27 ms 4300 KB Output is correct
25 Correct 27 ms 4412 KB Output is correct
26 Correct 27 ms 4392 KB Output is correct
27 Execution timed out 3081 ms 327836 KB Time limit exceeded
28 Halted 0 ms 0 KB -