oj.uz

Submission #397485

# Submission time Handle Problem Language Result Execution time Memory
397485 2021-05-02T09:46:59 Z AriaH Circle selection (APIO18_circle_selection) C++17
87 / 100
 3000 ms 331540 KB 
/* There's someone in my head but it's not me */ 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("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
 
const int N = 3e5 + 4, MOD = 1e9 + 7;
int n, X[N], Y[N], R[N], ord[N], xord[N], pos[N], ret[N]; vector<int> ids;

ll base[N];

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;
}
 
struct node : set<pii> {
    node *lc, *rc;
 
    node() : lc(nullptr), rc(nullptr) {}
 
    void build(int l = 1, int r = n + 1) {
        for (int i = l; i < r; i++) {
            this->insert({Y[xord[i]], xord[i]});
        }
        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);
    }
 
    void get(ll xl, ll xr, ll yl, ll yr, int &id, int l = 1, int r = n + 1) {
        if (xr <= X[xord[l]] || X[xord[r - 1]] + 1 <= xl) return;
        if (xl <= X[xord[l]] && X[xord[r - 1]] + 1 <= xr) {
            for (auto it = this->lower_bound({yl, -1e9}); it != this->end() && it->F <= yr; ) {
                auto x = *it;
                if (ret[x.S]) this->erase(x);
                else if (intersect(id, x.S)) ret[x.S] = id;
                it = this->upper_bound(x);
            }
            return;
        }
        int md = (l + r) >> 1;
        lc->get(xl, xr, yl, yr, id, l, md), rc->get(xl, xr, yl, yr, id, md, r);
    }
    
};
node* seg;
 
int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) 
        scanf("%d%d%d", &X[i], &Y[i], &R[i]);
    for(int i = 1 ;i <= n; 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]; });
    seg = new node(); seg->build();
    for (int i = 1; i <= n; i++) pos[xord[i]] = i;
    for (int _ = 1; _ <= n; _++) {
        int i = ord[_]; 
        if (ret[i]) continue;
        seg->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: In function 'int main()':
circle_selection.cpp:67:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   67 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:69:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   69 |         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 356 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 972 KB Output is correct
17 Correct 3 ms 972 KB Output is correct
18 Correct 3 ms 972 KB Output is correct
19 Correct 13 ms 4428 KB Output is correct
20 Correct 16 ms 4428 KB Output is correct
21 Correct 14 ms 4452 KB Output is correct
22 Correct 14 ms 4468 KB Output is correct
23 Correct 16 ms 4480 KB Output is correct
24 Correct 15 ms 4428 KB Output is correct
25 Correct 14 ms 4396 KB Output is correct
26 Correct 14 ms 4400 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1339 ms 331108 KB Output is correct
2 Correct 1343 ms 331108 KB Output is correct
3 Correct 1366 ms 330892 KB Output is correct
4 Correct 1319 ms 331156 KB Output is correct
5 Correct 1378 ms 331084 KB Output is correct
6 Correct 1475 ms 331064 KB Output is correct
7 Correct 1366 ms 330996 KB Output is correct
8 Correct 1406 ms 331044 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 573 ms 103080 KB Output is correct
3 Correct 2149 ms 331360 KB Output is correct
4 Correct 2146 ms 331060 KB Output is correct
5 Correct 2044 ms 321472 KB Output is correct
6 Correct 841 ms 165768 KB Output is correct
7 Correct 371 ms 83872 KB Output is correct
8 Correct 52 ms 15652 KB Output is correct
9 Correct 2105 ms 331004 KB Output is correct
10 Correct 2130 ms 331008 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1980 ms 331160 KB Output is correct
2 Correct 1855 ms 331004 KB Output is correct
3 Correct 1795 ms 330572 KB Output is correct
4 Correct 1771 ms 330988 KB Output is correct
5 Correct 1866 ms 331464 KB Output is correct
6 Correct 1562 ms 330736 KB Output is correct

Subtask #5
30.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 356 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 972 KB Output is correct
17 Correct 3 ms 972 KB Output is correct
18 Correct 3 ms 972 KB Output is correct
19 Correct 13 ms 4428 KB Output is correct
20 Correct 16 ms 4428 KB Output is correct
21 Correct 14 ms 4452 KB Output is correct
22 Correct 14 ms 4468 KB Output is correct
23 Correct 16 ms 4480 KB Output is correct
24 Correct 15 ms 4428 KB Output is correct
25 Correct 14 ms 4396 KB Output is correct
26 Correct 14 ms 4400 KB Output is correct
27 Correct 29 ms 9128 KB Output is correct
28 Correct 30 ms 9112 KB Output is correct
29 Correct 28 ms 9060 KB Output is correct
30 Correct 34 ms 9048 KB Output is correct
31 Correct 32 ms 9156 KB Output is correct
32 Correct 32 ms 9060 KB Output is correct
33 Correct 379 ms 103524 KB Output is correct
34 Correct 379 ms 103496 KB Output is correct
35 Correct 403 ms 103492 KB Output is correct
36 Correct 501 ms 103492 KB Output is correct
37 Correct 554 ms 103464 KB Output is correct
38 Correct 536 ms 103568 KB Output is correct
39 Correct 1380 ms 103336 KB Output is correct
40 Correct 1319 ms 103304 KB Output is correct
41 Correct 1360 ms 103272 KB Output is correct
42 Correct 483 ms 103236 KB Output is correct
43 Correct 396 ms 103460 KB Output is correct
44 Correct 389 ms 103528 KB Output is correct
45 Correct 400 ms 103536 KB Output is correct
46 Correct 384 ms 103520 KB Output is correct
47 Correct 389 ms 103464 KB Output is correct
48 Correct 390 ms 103476 KB Output is correct
49 Correct 381 ms 103456 KB Output is correct
50 Correct 384 ms 103448 KB Output is correct

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 356 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 972 KB Output is correct
17 Correct 3 ms 972 KB Output is correct
18 Correct 3 ms 972 KB Output is correct
19 Correct 13 ms 4428 KB Output is correct
20 Correct 16 ms 4428 KB Output is correct
21 Correct 14 ms 4452 KB Output is correct
22 Correct 14 ms 4468 KB Output is correct
23 Correct 16 ms 4480 KB Output is correct
24 Correct 15 ms 4428 KB Output is correct
25 Correct 14 ms 4396 KB Output is correct
26 Correct 14 ms 4400 KB Output is correct
27 Correct 1339 ms 331108 KB Output is correct
28 Correct 1343 ms 331108 KB Output is correct
29 Correct 1366 ms 330892 KB Output is correct
30 Correct 1319 ms 331156 KB Output is correct
31 Correct 1378 ms 331084 KB Output is correct
32 Correct 1475 ms 331064 KB Output is correct
33 Correct 1366 ms 330996 KB Output is correct
34 Correct 1406 ms 331044 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 573 ms 103080 KB Output is correct
37 Correct 2149 ms 331360 KB Output is correct
38 Correct 2146 ms 331060 KB Output is correct
39 Correct 2044 ms 321472 KB Output is correct
40 Correct 841 ms 165768 KB Output is correct
41 Correct 371 ms 83872 KB Output is correct
42 Correct 52 ms 15652 KB Output is correct
43 Correct 2105 ms 331004 KB Output is correct
44 Correct 2130 ms 331008 KB Output is correct
45 Correct 1980 ms 331160 KB Output is correct
46 Correct 1855 ms 331004 KB Output is correct
47 Correct 1795 ms 330572 KB Output is correct
48 Correct 1771 ms 330988 KB Output is correct
49 Correct 1866 ms 331464 KB Output is correct
50 Correct 1562 ms 330736 KB Output is correct
51 Correct 29 ms 9128 KB Output is correct
52 Correct 30 ms 9112 KB Output is correct
53 Correct 28 ms 9060 KB Output is correct
54 Correct 34 ms 9048 KB Output is correct
55 Correct 32 ms 9156 KB Output is correct
56 Correct 32 ms 9060 KB Output is correct
57 Correct 379 ms 103524 KB Output is correct
58 Correct 379 ms 103496 KB Output is correct
59 Correct 403 ms 103492 KB Output is correct
60 Correct 501 ms 103492 KB Output is correct
61 Correct 554 ms 103464 KB Output is correct
62 Correct 536 ms 103568 KB Output is correct
63 Correct 1380 ms 103336 KB Output is correct
64 Correct 1319 ms 103304 KB Output is correct
65 Correct 1360 ms 103272 KB Output is correct
66 Correct 483 ms 103236 KB Output is correct
67 Correct 396 ms 103460 KB Output is correct
68 Correct 389 ms 103528 KB Output is correct
69 Correct 400 ms 103536 KB Output is correct
70 Correct 384 ms 103520 KB Output is correct
71 Correct 389 ms 103464 KB Output is correct
72 Correct 390 ms 103476 KB Output is correct
73 Correct 381 ms 103456 KB Output is correct
74 Correct 384 ms 103448 KB Output is correct
75 Correct 1600 ms 331252 KB Output is correct
76 Correct 1528 ms 331540 KB Output is correct
77 Correct 1449 ms 331472 KB Output is correct
78 Correct 1414 ms 331168 KB Output is correct
79 Correct 1709 ms 331364 KB Output is correct
80 Correct 1487 ms 331268 KB Output is correct
81 Correct 2237 ms 331256 KB Output is correct
82 Correct 2101 ms 331252 KB Output is correct
83 Correct 2179 ms 331204 KB Output is correct
84 Correct 2415 ms 331296 KB Output is correct
85 Correct 2170 ms 331252 KB Output is correct
86 Correct 2088 ms 331252 KB Output is correct
87 Execution timed out 3109 ms 329296 KB Time limit exceeded
88 Halted 0 ms 0 KB -