oj.uz

Submission #397486

# Submission time Handle Problem Language Result Execution time Memory
397486 2021-05-02T09:47:33 Z parsabahrami Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 340956 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 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], xord[N], pos[N], ret[N]; ll base[N];
set<pii> seg[N << 2];

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

void build(int id = 1, int l = 1, int r = n + 1) {
    for (int i = l; i < r; i++) {
        seg[id].insert({Y[xord[i]], xord[i]});
    }
    if (r - l < 2) return;
    int md = (l + r) >> 1;
    build(lc, l, md), build(rc, md, r);
}

void get(ll xl, ll xr, ll yl, ll yr, int &p, int id = 1, int l = 1, int r = n + 1) {
    if (xr <= X[xord[l]] || X[xord[r - 1]] + 1 <= xl || seg[id].empty()) return;
    if (xl <= X[xord[l]] && X[xord[r - 1]] + 1 <= xr) {
        for (auto it = seg[id].lower_bound({yl, -1e9}); it != seg[id].end() && it->F <= yr; ) {
            auto x = *it;
            if (ret[x.S]) seg[id].erase(x);
            else if (intersect(p, x.S)) ret[x.S] = p;
            it = seg[id].upper_bound(x);
        }
        return;
    }
    int md = (l + r) >> 1;
    get(xl, xr, yl, yr, p, lc, l, md), get(xl, xr, yl, yr, p, rc, md, r);
}

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];
    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]; });
    build();
    for (int i = 1; i <= n; i++) pos[xord[i]] = i;
    for (int _ = 1; _ <= n; _++) {
        int i = ord[_]; 
        if (ret[i]) continue;
        get(X[i] - 2ll * R[i], 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:51:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   51 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:53:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   53 |         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];
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 56696 KB Output is correct
2 Correct 34 ms 56632 KB Output is correct
3 Correct 34 ms 56596 KB Output is correct
4 Correct 33 ms 56668 KB Output is correct
5 Correct 33 ms 56696 KB Output is correct
6 Correct 33 ms 56652 KB Output is correct
7 Correct 33 ms 56696 KB Output is correct
8 Correct 32 ms 56652 KB Output is correct
9 Correct 33 ms 56712 KB Output is correct
10 Correct 32 ms 56652 KB Output is correct
11 Correct 30 ms 56652 KB Output is correct
12 Correct 30 ms 56664 KB Output is correct
13 Correct 31 ms 56700 KB Output is correct
14 Correct 30 ms 56684 KB Output is correct
15 Correct 29 ms 56664 KB Output is correct
16 Correct 33 ms 57164 KB Output is correct
17 Correct 32 ms 57188 KB Output is correct
18 Correct 31 ms 57164 KB Output is correct
19 Correct 46 ms 60008 KB Output is correct
20 Correct 49 ms 59968 KB Output is correct
21 Correct 51 ms 59956 KB Output is correct
22 Correct 51 ms 59924 KB Output is correct
23 Correct 51 ms 59992 KB Output is correct
24 Correct 49 ms 59928 KB Output is correct
25 Correct 46 ms 59956 KB Output is correct
26 Correct 47 ms 59972 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1677 ms 340656 KB Output is correct
2 Correct 1725 ms 340956 KB Output is correct
3 Correct 1736 ms 340940 KB Output is correct
4 Correct 1687 ms 340944 KB Output is correct
5 Correct 1729 ms 340636 KB Output is correct
6 Correct 1807 ms 340860 KB Output is correct
7 Correct 1726 ms 340700 KB Output is correct
8 Correct 1727 ms 340740 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 56720 KB Output is correct
2 Correct 691 ms 144264 KB Output is correct
3 Correct 2638 ms 340768 KB Output is correct
4 Correct 2542 ms 340816 KB Output is correct
5 Correct 2443 ms 332468 KB Output is correct
6 Correct 1030 ms 198092 KB Output is correct
7 Correct 462 ms 127740 KB Output is correct
8 Correct 93 ms 69572 KB Output is correct
9 Correct 2567 ms 340896 KB Output is correct
10 Correct 2504 ms 340784 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2328 ms 340784 KB Output is correct
2 Correct 2112 ms 340808 KB Output is correct
3 Correct 2024 ms 340404 KB Output is correct
4 Correct 2090 ms 340800 KB Output is correct
5 Correct 2140 ms 340420 KB Output is correct
6 Correct 1840 ms 339748 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 56696 KB Output is correct
2 Correct 34 ms 56632 KB Output is correct
3 Correct 34 ms 56596 KB Output is correct
4 Correct 33 ms 56668 KB Output is correct
5 Correct 33 ms 56696 KB Output is correct
6 Correct 33 ms 56652 KB Output is correct
7 Correct 33 ms 56696 KB Output is correct
8 Correct 32 ms 56652 KB Output is correct
9 Correct 33 ms 56712 KB Output is correct
10 Correct 32 ms 56652 KB Output is correct
11 Correct 30 ms 56652 KB Output is correct
12 Correct 30 ms 56664 KB Output is correct
13 Correct 31 ms 56700 KB Output is correct
14 Correct 30 ms 56684 KB Output is correct
15 Correct 29 ms 56664 KB Output is correct
16 Correct 33 ms 57164 KB Output is correct
17 Correct 32 ms 57188 KB Output is correct
18 Correct 31 ms 57164 KB Output is correct
19 Correct 46 ms 60008 KB Output is correct
20 Correct 49 ms 59968 KB Output is correct
21 Correct 51 ms 59956 KB Output is correct
22 Correct 51 ms 59924 KB Output is correct
23 Correct 51 ms 59992 KB Output is correct
24 Correct 49 ms 59928 KB Output is correct
25 Correct 46 ms 59956 KB Output is correct
26 Correct 47 ms 59972 KB Output is correct
27 Correct 61 ms 63772 KB Output is correct
28 Correct 61 ms 63824 KB Output is correct
29 Correct 62 ms 63728 KB Output is correct
30 Correct 88 ms 63832 KB Output is correct
31 Correct 112 ms 63812 KB Output is correct
32 Correct 65 ms 63824 KB Output is correct
33 Correct 480 ms 143908 KB Output is correct
34 Correct 470 ms 143836 KB Output is correct
35 Correct 508 ms 143892 KB Output is correct
36 Correct 610 ms 143876 KB Output is correct
37 Correct 602 ms 143884 KB Output is correct
38 Correct 614 ms 143904 KB Output is correct
39 Correct 1350 ms 143796 KB Output is correct
40 Correct 1335 ms 143812 KB Output is correct
41 Correct 1431 ms 143812 KB Output is correct
42 Correct 604 ms 143832 KB Output is correct
43 Correct 458 ms 143924 KB Output is correct
44 Correct 434 ms 143800 KB Output is correct
45 Correct 435 ms 143888 KB Output is correct
46 Correct 445 ms 143876 KB Output is correct
47 Correct 441 ms 143924 KB Output is correct
48 Correct 436 ms 143816 KB Output is correct
49 Correct 443 ms 143884 KB Output is correct
50 Correct 443 ms 143880 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 56696 KB Output is correct
2 Correct 34 ms 56632 KB Output is correct
3 Correct 34 ms 56596 KB Output is correct
4 Correct 33 ms 56668 KB Output is correct
5 Correct 33 ms 56696 KB Output is correct
6 Correct 33 ms 56652 KB Output is correct
7 Correct 33 ms 56696 KB Output is correct
8 Correct 32 ms 56652 KB Output is correct
9 Correct 33 ms 56712 KB Output is correct
10 Correct 32 ms 56652 KB Output is correct
11 Correct 30 ms 56652 KB Output is correct
12 Correct 30 ms 56664 KB Output is correct
13 Correct 31 ms 56700 KB Output is correct
14 Correct 30 ms 56684 KB Output is correct
15 Correct 29 ms 56664 KB Output is correct
16 Correct 33 ms 57164 KB Output is correct
17 Correct 32 ms 57188 KB Output is correct
18 Correct 31 ms 57164 KB Output is correct
19 Correct 46 ms 60008 KB Output is correct
20 Correct 49 ms 59968 KB Output is correct
21 Correct 51 ms 59956 KB Output is correct
22 Correct 51 ms 59924 KB Output is correct
23 Correct 51 ms 59992 KB Output is correct
24 Correct 49 ms 59928 KB Output is correct
25 Correct 46 ms 59956 KB Output is correct
26 Correct 47 ms 59972 KB Output is correct
27 Correct 1677 ms 340656 KB Output is correct
28 Correct 1725 ms 340956 KB Output is correct
29 Correct 1736 ms 340940 KB Output is correct
30 Correct 1687 ms 340944 KB Output is correct
31 Correct 1729 ms 340636 KB Output is correct
32 Correct 1807 ms 340860 KB Output is correct
33 Correct 1726 ms 340700 KB Output is correct
34 Correct 1727 ms 340740 KB Output is correct
35 Correct 30 ms 56720 KB Output is correct
36 Correct 691 ms 144264 KB Output is correct
37 Correct 2638 ms 340768 KB Output is correct
38 Correct 2542 ms 340816 KB Output is correct
39 Correct 2443 ms 332468 KB Output is correct
40 Correct 1030 ms 198092 KB Output is correct
41 Correct 462 ms 127740 KB Output is correct
42 Correct 93 ms 69572 KB Output is correct
43 Correct 2567 ms 340896 KB Output is correct
44 Correct 2504 ms 340784 KB Output is correct
45 Correct 2328 ms 340784 KB Output is correct
46 Correct 2112 ms 340808 KB Output is correct
47 Correct 2024 ms 340404 KB Output is correct
48 Correct 2090 ms 340800 KB Output is correct
49 Correct 2140 ms 340420 KB Output is correct
50 Correct 1840 ms 339748 KB Output is correct
51 Correct 61 ms 63772 KB Output is correct
52 Correct 61 ms 63824 KB Output is correct
53 Correct 62 ms 63728 KB Output is correct
54 Correct 88 ms 63832 KB Output is correct
55 Correct 112 ms 63812 KB Output is correct
56 Correct 65 ms 63824 KB Output is correct
57 Correct 480 ms 143908 KB Output is correct
58 Correct 470 ms 143836 KB Output is correct
59 Correct 508 ms 143892 KB Output is correct
60 Correct 610 ms 143876 KB Output is correct
61 Correct 602 ms 143884 KB Output is correct
62 Correct 614 ms 143904 KB Output is correct
63 Correct 1350 ms 143796 KB Output is correct
64 Correct 1335 ms 143812 KB Output is correct
65 Correct 1431 ms 143812 KB Output is correct
66 Correct 604 ms 143832 KB Output is correct
67 Correct 458 ms 143924 KB Output is correct
68 Correct 434 ms 143800 KB Output is correct
69 Correct 435 ms 143888 KB Output is correct
70 Correct 445 ms 143876 KB Output is correct
71 Correct 441 ms 143924 KB Output is correct
72 Correct 436 ms 143816 KB Output is correct
73 Correct 443 ms 143884 KB Output is correct
74 Correct 443 ms 143880 KB Output is correct
75 Correct 1758 ms 340368 KB Output is correct
76 Correct 1705 ms 340636 KB Output is correct
77 Correct 1709 ms 340584 KB Output is correct
78 Correct 1773 ms 340276 KB Output is correct
79 Correct 1997 ms 340460 KB Output is correct
80 Correct 1694 ms 340436 KB Output is correct
81 Correct 2392 ms 340504 KB Output is correct
82 Correct 2303 ms 340524 KB Output is correct
83 Correct 2299 ms 340592 KB Output is correct
84 Correct 2595 ms 340740 KB Output is correct
85 Correct 2376 ms 340512 KB Output is correct
86 Correct 2313 ms 340468 KB Output is correct
87 Execution timed out 3099 ms 340424 KB Time limit exceeded
88 Halted 0 ms 0 KB -