oj.uz

Submission #397540

# Submission time Handle Problem Language Result Execution time Memory
397540 2021-05-02T10:42:43 Z parsabahrami Circle selection (APIO18_circle_selection) C++17
7 / 100
 3000 ms 274108 KB 
/* There's someone in my head but it's not me */ 
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")

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) {
    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() + 1;
}

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;
    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];
	    add(lwr(X[I]), make_pair(Y[I], I));
    }
    for (int _ = 1; _ <= n; _++) {
        int i = ord[_];
        if (ret[i]) continue;
        get(lwr(X[i] - 2ll * R[i]), 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:3: warning: ignoring #pragma comment  [-Wunknown-pragmas]
    3 | #pragma comment(linker, "/stack:200000000")
      | 
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 31 ms 56652 KB Output is correct
2 Correct 29 ms 56640 KB Output is correct
3 Correct 30 ms 56576 KB Output is correct
4 Correct 29 ms 56644 KB Output is correct
5 Correct 30 ms 56700 KB Output is correct
6 Correct 30 ms 56692 KB Output is correct
7 Correct 30 ms 56640 KB Output is correct
8 Correct 30 ms 56752 KB Output is correct
9 Correct 30 ms 56720 KB Output is correct
10 Correct 30 ms 56708 KB Output is correct
11 Correct 30 ms 56704 KB Output is correct
12 Correct 30 ms 56648 KB Output is correct
13 Correct 32 ms 56652 KB Output is correct
14 Correct 32 ms 56712 KB Output is correct
15 Correct 30 ms 56740 KB Output is correct
16 Correct 36 ms 57128 KB Output is correct
17 Correct 38 ms 57276 KB Output is correct
18 Correct 34 ms 57164 KB Output is correct
19 Correct 50 ms 60032 KB Output is correct
20 Correct 50 ms 60040 KB Output is correct
21 Correct 50 ms 60108 KB Output is correct
22 Correct 50 ms 60124 KB Output is correct
23 Correct 52 ms 60096 KB Output is correct
24 Correct 50 ms 60072 KB Output is correct
25 Correct 51 ms 60028 KB Output is correct
26 Correct 60 ms 60052 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 56632 KB Output is correct
2 Correct 1500 ms 143952 KB Output is correct
3 Execution timed out 3100 ms 274108 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 3096 ms 269148 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 56652 KB Output is correct
2 Correct 29 ms 56640 KB Output is correct
3 Correct 30 ms 56576 KB Output is correct
4 Correct 29 ms 56644 KB Output is correct
5 Correct 30 ms 56700 KB Output is correct
6 Correct 30 ms 56692 KB Output is correct
7 Correct 30 ms 56640 KB Output is correct
8 Correct 30 ms 56752 KB Output is correct
9 Correct 30 ms 56720 KB Output is correct
10 Correct 30 ms 56708 KB Output is correct
11 Correct 30 ms 56704 KB Output is correct
12 Correct 30 ms 56648 KB Output is correct
13 Correct 32 ms 56652 KB Output is correct
14 Correct 32 ms 56712 KB Output is correct
15 Correct 30 ms 56740 KB Output is correct
16 Correct 36 ms 57128 KB Output is correct
17 Correct 38 ms 57276 KB Output is correct
18 Correct 34 ms 57164 KB Output is correct
19 Correct 50 ms 60032 KB Output is correct
20 Correct 50 ms 60040 KB Output is correct
21 Correct 50 ms 60108 KB Output is correct
22 Correct 50 ms 60124 KB Output is correct
23 Correct 52 ms 60096 KB Output is correct
24 Correct 50 ms 60072 KB Output is correct
25 Correct 51 ms 60028 KB Output is correct
26 Correct 60 ms 60052 KB Output is correct
27 Correct 75 ms 63764 KB Output is correct
28 Correct 79 ms 63788 KB Output is correct
29 Correct 74 ms 63812 KB Output is correct
30 Correct 81 ms 63792 KB Output is correct
31 Correct 77 ms 63768 KB Output is correct
32 Correct 89 ms 63988 KB Output is correct
33 Correct 1324 ms 143788 KB Output is correct
34 Correct 1259 ms 144036 KB Output is correct
35 Correct 1341 ms 143844 KB Output is correct
36 Correct 1374 ms 143756 KB Output is correct
37 Correct 1398 ms 143876 KB Output is correct
38 Correct 1377 ms 143928 KB Output is correct
39 Incorrect 2634 ms 140552 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 56652 KB Output is correct
2 Correct 29 ms 56640 KB Output is correct
3 Correct 30 ms 56576 KB Output is correct
4 Correct 29 ms 56644 KB Output is correct
5 Correct 30 ms 56700 KB Output is correct
6 Correct 30 ms 56692 KB Output is correct
7 Correct 30 ms 56640 KB Output is correct
8 Correct 30 ms 56752 KB Output is correct
9 Correct 30 ms 56720 KB Output is correct
10 Correct 30 ms 56708 KB Output is correct
11 Correct 30 ms 56704 KB Output is correct
12 Correct 30 ms 56648 KB Output is correct
13 Correct 32 ms 56652 KB Output is correct
14 Correct 32 ms 56712 KB Output is correct
15 Correct 30 ms 56740 KB Output is correct
16 Correct 36 ms 57128 KB Output is correct
17 Correct 38 ms 57276 KB Output is correct
18 Correct 34 ms 57164 KB Output is correct
19 Correct 50 ms 60032 KB Output is correct
20 Correct 50 ms 60040 KB Output is correct
21 Correct 50 ms 60108 KB Output is correct
22 Correct 50 ms 60124 KB Output is correct
23 Correct 52 ms 60096 KB Output is correct
24 Correct 50 ms 60072 KB Output is correct
25 Correct 51 ms 60028 KB Output is correct
26 Correct 60 ms 60052 KB Output is correct
27 Execution timed out 3077 ms 266944 KB Time limit exceeded
28 Halted 0 ms 0 KB -