oj.uz

Submission #397544

# Submission time Handle Problem Language Result Execution time Memory
397544 2021-05-02T10:45:55 Z AriaH Circle selection (APIO18_circle_selection) C++11
37 / 100
 3000 ms 248800 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 all(x) x.begin(), x.end()

#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second
#define lc                          id << 1
#define rc                          lc | 1

const int N = 3e5 + 4, MOD = 1e9 + 7;
int n, X[N], Y[N], R[N], ord[N], ret[N], id[N]; ll base[N];
set<pii> seg[N << 1];

vector <ll> cm;

bool cmp(int i, int j) {
	if(R[i] == R[j]) return i < j;
    return R[i] > R[j];
}

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

int lwr(ll x) {
    return lower_bound(all(cm), x) - cm.begin();
}

void add(int pos, pii x) {
    pos += n;
    while (pos) {
	    seg[pos].insert(x);
	    pos >>= 1;
    }
}

void get(int ql, int qr, ll yl, ll yr, int p) {
    ql += n, qr += n + 1;
    while (qr - ql > 0) {
        if (ql & 1) {
            for (auto it = seg[ql].lower_bound({yl, -1e9}); it != seg[ql].end() && it->F <= yr; ) {
                auto x = *it;
                if (ret[x.S]) seg[ql].erase(x);
                else if (intersect(p, x.S)) ret[x.S] = p;
                it = seg[ql].upper_bound(x);
            }
            ql++;
        } 
        if (qr & 1) {
            qr--;
            for (auto it = seg[qr].lower_bound({yl, -1e9}); it != seg[qr].end() && it->F <= yr; ) {
                auto x = *it;
                if (ret[x.S]) seg[qr].erase(x);
                else if (intersect(p, x.S)) ret[x.S] = p;
                it = seg[qr].upper_bound(x);
            }
        }
        qr >>= 1, ql >>= 1;
    }
}

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], cm.push_back(X[i]), ord[i] = i;
    sort(ord + 1, ord + n + 1, cmp);
    sort(all(cm));
    cm.resize(unique(all(cm)) - cm.begin());
    for(int i = 1; i <= n; i ++) {
	    int I = ord[i];
		///printf("i = %d I = %d X = %d\n", i, I, X[I]);
	    add(lwr(X[I]) + 1, make_pair(Y[I], I));
    }
    for (int _ = 1; _ <= n; _++) {
        int i = ord[_];
        if (ret[i]) continue;
        get(lwr(X[i] - 2ll * R[i]) + 1, lwr(X[i] + 2ll * R[i] + 1), Y[i] - 2ll * R[i], Y[i] + 2ll * R[i], i);
    }
    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:72:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   72 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:74:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   74 |         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], cm.push_back(X[i]), ord[i] = i;
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28472 KB Output is correct
2 Correct 16 ms 28456 KB Output is correct
3 Correct 16 ms 28492 KB Output is correct
4 Correct 16 ms 28416 KB Output is correct
5 Correct 16 ms 28508 KB Output is correct
6 Correct 16 ms 28492 KB Output is correct
7 Correct 17 ms 28508 KB Output is correct
8 Correct 16 ms 28492 KB Output is correct
9 Correct 17 ms 28492 KB Output is correct
10 Correct 17 ms 28440 KB Output is correct
11 Correct 16 ms 28492 KB Output is correct
12 Correct 16 ms 28528 KB Output is correct
13 Correct 17 ms 28608 KB Output is correct
14 Correct 16 ms 28460 KB Output is correct
15 Correct 16 ms 28488 KB Output is correct
16 Correct 19 ms 29004 KB Output is correct
17 Correct 21 ms 29004 KB Output is correct
18 Correct 18 ms 29004 KB Output is correct
19 Correct 34 ms 31724 KB Output is correct
20 Correct 34 ms 31792 KB Output is correct
21 Correct 36 ms 31780 KB Output is correct
22 Correct 34 ms 31736 KB Output is correct
23 Correct 38 ms 31832 KB Output is correct
24 Correct 35 ms 31840 KB Output is correct
25 Correct 34 ms 31812 KB Output is correct
26 Correct 34 ms 31812 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28492 KB Output is correct
2 Correct 1413 ms 115644 KB Output is correct
3 Execution timed out 3111 ms 247100 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 3103 ms 248800 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28472 KB Output is correct
2 Correct 16 ms 28456 KB Output is correct
3 Correct 16 ms 28492 KB Output is correct
4 Correct 16 ms 28416 KB Output is correct
5 Correct 16 ms 28508 KB Output is correct
6 Correct 16 ms 28492 KB Output is correct
7 Correct 17 ms 28508 KB Output is correct
8 Correct 16 ms 28492 KB Output is correct
9 Correct 17 ms 28492 KB Output is correct
10 Correct 17 ms 28440 KB Output is correct
11 Correct 16 ms 28492 KB Output is correct
12 Correct 16 ms 28528 KB Output is correct
13 Correct 17 ms 28608 KB Output is correct
14 Correct 16 ms 28460 KB Output is correct
15 Correct 16 ms 28488 KB Output is correct
16 Correct 19 ms 29004 KB Output is correct
17 Correct 21 ms 29004 KB Output is correct
18 Correct 18 ms 29004 KB Output is correct
19 Correct 34 ms 31724 KB Output is correct
20 Correct 34 ms 31792 KB Output is correct
21 Correct 36 ms 31780 KB Output is correct
22 Correct 34 ms 31736 KB Output is correct
23 Correct 38 ms 31832 KB Output is correct
24 Correct 35 ms 31840 KB Output is correct
25 Correct 34 ms 31812 KB Output is correct
26 Correct 34 ms 31812 KB Output is correct
27 Correct 62 ms 35628 KB Output is correct
28 Correct 58 ms 35652 KB Output is correct
29 Correct 58 ms 35640 KB Output is correct
30 Correct 63 ms 35616 KB Output is correct
31 Correct 62 ms 35584 KB Output is correct
32 Correct 63 ms 35624 KB Output is correct
33 Correct 1310 ms 115728 KB Output is correct
34 Correct 1286 ms 115772 KB Output is correct
35 Correct 1290 ms 115692 KB Output is correct
36 Correct 1338 ms 115632 KB Output is correct
37 Correct 1364 ms 115732 KB Output is correct
38 Correct 1357 ms 115644 KB Output is correct
39 Correct 2646 ms 112380 KB Output is correct
40 Correct 2672 ms 112416 KB Output is correct
41 Correct 2662 ms 112380 KB Output is correct
42 Correct 1311 ms 112276 KB Output is correct
43 Correct 881 ms 115620 KB Output is correct
44 Correct 889 ms 115700 KB Output is correct
45 Correct 904 ms 115652 KB Output is correct
46 Correct 881 ms 115644 KB Output is correct
47 Correct 867 ms 115668 KB Output is correct
48 Correct 893 ms 115632 KB Output is correct
49 Correct 871 ms 115640 KB Output is correct
50 Correct 875 ms 115640 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28472 KB Output is correct
2 Correct 16 ms 28456 KB Output is correct
3 Correct 16 ms 28492 KB Output is correct
4 Correct 16 ms 28416 KB Output is correct
5 Correct 16 ms 28508 KB Output is correct
6 Correct 16 ms 28492 KB Output is correct
7 Correct 17 ms 28508 KB Output is correct
8 Correct 16 ms 28492 KB Output is correct
9 Correct 17 ms 28492 KB Output is correct
10 Correct 17 ms 28440 KB Output is correct
11 Correct 16 ms 28492 KB Output is correct
12 Correct 16 ms 28528 KB Output is correct
13 Correct 17 ms 28608 KB Output is correct
14 Correct 16 ms 28460 KB Output is correct
15 Correct 16 ms 28488 KB Output is correct
16 Correct 19 ms 29004 KB Output is correct
17 Correct 21 ms 29004 KB Output is correct
18 Correct 18 ms 29004 KB Output is correct
19 Correct 34 ms 31724 KB Output is correct
20 Correct 34 ms 31792 KB Output is correct
21 Correct 36 ms 31780 KB Output is correct
22 Correct 34 ms 31736 KB Output is correct
23 Correct 38 ms 31832 KB Output is correct
24 Correct 35 ms 31840 KB Output is correct
25 Correct 34 ms 31812 KB Output is correct
26 Correct 34 ms 31812 KB Output is correct
27 Execution timed out 3096 ms 241648 KB Time limit exceeded
28 Halted 0 ms 0 KB -