oj.uz

Submission #397218

# Submission time Handle Problem Language Result Execution time Memory
397218 2021-05-01T17:47:44 Z parsabahrami Circle selection (APIO18_circle_selection) C++17
7 / 100
 3000 ms 326820 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];
struct node : set<pii> {
    node *lc, *rc; 

    node() : lc(nullptr), rc(nullptr) {}

    void build(int l = 1, int r = n + 1) {
        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);
    }

    int 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 -1;
        if (xl <= X[xord[l]] && X[xord[r - 1]] + 1 <= xr) {
            auto lb = this->lower_bound({yl, -1e9});
            if (lb != this->end() && lb->F <= yr) return lb->S;
            else return -1;
        }
        int md = (l + r) >> 1, a;
        a = lc->get(xl, xr, yl, yr, l, md);
        if (~a) return a;
        return rc->get(xl, xr, yl, yr, md, r);
    }
    
    void ins(int p, int y, int id, int l = 1, int r = n + 1) {
        this->insert({y, id});
        if (r - l < 2) return;
        int md = (l + r) >> 1;
        if (p < md) lc->ins(p, y, id, l, md);
        else rc->ins(p, y, id, 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++) {
        seg->ins(i, Y[xord[i]], xord[i]), pos[xord[i]] = i;
    }
    for (int _ = 1; _ <= n; _++) {
        int i = ord[_]; vector<int> ids;
        if (ret[i]) continue;
        for (;;) {
            int id = seg->get(X[i] - 2ll * R[i], X[i] + 2ll * R[i] + 1, Y[i] - 2ll * R[i], Y[i] + 2ll * R[i]);
            if (~id) ids.push_back(id), seg->remove(pos[id], id);
            else break;
        }
        for (int &id : ids) {
            if (intersect(i, id)) ret[id] = i;
            else seg->ins(pos[id], Y[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: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]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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 5 ms 1032 KB Output is correct
18 Correct 4 ms 972 KB Output is correct
19 Correct 22 ms 4384 KB Output is correct
20 Correct 23 ms 4388 KB Output is correct
21 Correct 26 ms 4432 KB Output is correct
22 Correct 30 ms 4312 KB Output is correct
23 Correct 30 ms 4384 KB Output is correct
24 Correct 38 ms 4324 KB Output is correct
25 Correct 28 ms 4300 KB Output is correct
26 Correct 28 ms 4396 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3082 ms 326796 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 1722 ms 102296 KB Output is correct
3 Execution timed out 3095 ms 326820 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 3082 ms 325976 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
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 5 ms 1032 KB Output is correct
18 Correct 4 ms 972 KB Output is correct
19 Correct 22 ms 4384 KB Output is correct
20 Correct 23 ms 4388 KB Output is correct
21 Correct 26 ms 4432 KB Output is correct
22 Correct 30 ms 4312 KB Output is correct
23 Correct 30 ms 4384 KB Output is correct
24 Correct 38 ms 4324 KB Output is correct
25 Correct 28 ms 4300 KB Output is correct
26 Correct 28 ms 4396 KB Output is correct
27 Correct 66 ms 9100 KB Output is correct
28 Correct 52 ms 9028 KB Output is correct
29 Correct 54 ms 8952 KB Output is correct
30 Correct 83 ms 9028 KB Output is correct
31 Correct 70 ms 8920 KB Output is correct
32 Correct 76 ms 8908 KB Output is correct
33 Correct 990 ms 102444 KB Output is correct
34 Correct 1041 ms 102524 KB Output is correct
35 Correct 1128 ms 102572 KB Output is correct
36 Correct 1649 ms 102392 KB Output is correct
37 Correct 1634 ms 102300 KB Output is correct
38 Correct 1639 ms 102280 KB Output is correct
39 Execution timed out 3100 ms 101916 KB Time limit exceeded
40 Halted 0 ms 0 KB -

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 5 ms 1032 KB Output is correct
18 Correct 4 ms 972 KB Output is correct
19 Correct 22 ms 4384 KB Output is correct
20 Correct 23 ms 4388 KB Output is correct
21 Correct 26 ms 4432 KB Output is correct
22 Correct 30 ms 4312 KB Output is correct
23 Correct 30 ms 4384 KB Output is correct
24 Correct 38 ms 4324 KB Output is correct
25 Correct 28 ms 4300 KB Output is correct
26 Correct 28 ms 4396 KB Output is correct
27 Execution timed out 3082 ms 326796 KB Time limit exceeded
28 Halted 0 ms 0 KB -