oj.uz

Submission #397541

# Submission time Handle Problem Language Result Execution time Memory
397541 2021-05-02T10:43:34 Z AriaH Circle selection (APIO18_circle_selection) C++14
7 / 100
 3000 ms 278492 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 << 2];

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:71:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   71 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:73:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   73 |         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 30 ms 56652 KB Output is correct
2 Correct 30 ms 56688 KB Output is correct
3 Correct 30 ms 56692 KB Output is correct
4 Correct 30 ms 56696 KB Output is correct
5 Correct 30 ms 56652 KB Output is correct
6 Correct 31 ms 56644 KB Output is correct
7 Correct 33 ms 56652 KB Output is correct
8 Correct 30 ms 56672 KB Output is correct
9 Correct 30 ms 56736 KB Output is correct
10 Correct 31 ms 56736 KB Output is correct
11 Correct 30 ms 56660 KB Output is correct
12 Correct 33 ms 56644 KB Output is correct
13 Correct 30 ms 56652 KB Output is correct
14 Correct 30 ms 56744 KB Output is correct
15 Correct 34 ms 56632 KB Output is correct
16 Correct 33 ms 57228 KB Output is correct
17 Correct 33 ms 57160 KB Output is correct
18 Correct 32 ms 57160 KB Output is correct
19 Correct 48 ms 59992 KB Output is correct
20 Correct 48 ms 59956 KB Output is correct
21 Correct 49 ms 59928 KB Output is correct
22 Correct 50 ms 59896 KB Output is correct
23 Correct 51 ms 60012 KB Output is correct
24 Correct 50 ms 59956 KB Output is correct
25 Correct 51 ms 60096 KB Output is correct
26 Correct 48 ms 59992 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 56652 KB Output is correct
2 Correct 1437 ms 143964 KB Output is correct
3 Execution timed out 3106 ms 272116 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 3088 ms 278492 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 56652 KB Output is correct
2 Correct 30 ms 56688 KB Output is correct
3 Correct 30 ms 56692 KB Output is correct
4 Correct 30 ms 56696 KB Output is correct
5 Correct 30 ms 56652 KB Output is correct
6 Correct 31 ms 56644 KB Output is correct
7 Correct 33 ms 56652 KB Output is correct
8 Correct 30 ms 56672 KB Output is correct
9 Correct 30 ms 56736 KB Output is correct
10 Correct 31 ms 56736 KB Output is correct
11 Correct 30 ms 56660 KB Output is correct
12 Correct 33 ms 56644 KB Output is correct
13 Correct 30 ms 56652 KB Output is correct
14 Correct 30 ms 56744 KB Output is correct
15 Correct 34 ms 56632 KB Output is correct
16 Correct 33 ms 57228 KB Output is correct
17 Correct 33 ms 57160 KB Output is correct
18 Correct 32 ms 57160 KB Output is correct
19 Correct 48 ms 59992 KB Output is correct
20 Correct 48 ms 59956 KB Output is correct
21 Correct 49 ms 59928 KB Output is correct
22 Correct 50 ms 59896 KB Output is correct
23 Correct 51 ms 60012 KB Output is correct
24 Correct 50 ms 59956 KB Output is correct
25 Correct 51 ms 60096 KB Output is correct
26 Correct 48 ms 59992 KB Output is correct
27 Correct 89 ms 63740 KB Output is correct
28 Correct 79 ms 63812 KB Output is correct
29 Correct 91 ms 63780 KB Output is correct
30 Correct 77 ms 63792 KB Output is correct
31 Correct 75 ms 63816 KB Output is correct
32 Correct 75 ms 63732 KB Output is correct
33 Correct 1295 ms 143812 KB Output is correct
34 Correct 1294 ms 143908 KB Output is correct
35 Correct 1317 ms 143896 KB Output is correct
36 Correct 1380 ms 144084 KB Output is correct
37 Correct 1367 ms 143864 KB Output is correct
38 Correct 1400 ms 143856 KB Output is correct
39 Correct 2804 ms 140572 KB Output is correct
40 Execution timed out 3019 ms 140564 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 56652 KB Output is correct
2 Correct 30 ms 56688 KB Output is correct
3 Correct 30 ms 56692 KB Output is correct
4 Correct 30 ms 56696 KB Output is correct
5 Correct 30 ms 56652 KB Output is correct
6 Correct 31 ms 56644 KB Output is correct
7 Correct 33 ms 56652 KB Output is correct
8 Correct 30 ms 56672 KB Output is correct
9 Correct 30 ms 56736 KB Output is correct
10 Correct 31 ms 56736 KB Output is correct
11 Correct 30 ms 56660 KB Output is correct
12 Correct 33 ms 56644 KB Output is correct
13 Correct 30 ms 56652 KB Output is correct
14 Correct 30 ms 56744 KB Output is correct
15 Correct 34 ms 56632 KB Output is correct
16 Correct 33 ms 57228 KB Output is correct
17 Correct 33 ms 57160 KB Output is correct
18 Correct 32 ms 57160 KB Output is correct
19 Correct 48 ms 59992 KB Output is correct
20 Correct 48 ms 59956 KB Output is correct
21 Correct 49 ms 59928 KB Output is correct
22 Correct 50 ms 59896 KB Output is correct
23 Correct 51 ms 60012 KB Output is correct
24 Correct 50 ms 59956 KB Output is correct
25 Correct 51 ms 60096 KB Output is correct
26 Correct 48 ms 59992 KB Output is correct
27 Execution timed out 3092 ms 271388 KB Time limit exceeded
28 Halted 0 ms 0 KB -