oj.uz

Submission #855751

# Submission time Handle Problem Language Result Execution time Memory
855751 2023-10-01T17:49:23 Z dlalswp25 Circle selection (APIO18_circle_selection) C++17
87 / 100
 3000 ms 241300 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>

using namespace std;
typedef pair<int, int> pii;

const int K = 2;

int N;
int X[303030];
int Y[303030];
int R[303030];
int XL[303030];
int XR[303030];
int ans[303030];
int cur;
char rr;

void rf(int &x) {
	x = 0;
	int sgn = 0;
	while (rr < 48 && rr != '-') rr = getchar();
	if (rr == '-') { sgn = 1; rr = getchar(); }
	while (47 < rr) { x = (x << 3) + (x << 1) + (rr & 15); rr = getchar(); }
	if (sgn) x = -x;
}

inline bool intersect(int i, int j) {
	long long dx = X[i] - X[j], dy = Y[i] - Y[j], r = R[i] + R[j];
	return dx * dx + dy * dy <= r * r;
}

inline void chk(int cand) {
	int &t = ans[cur];
	if (R[cand] < R[t] || (R[cand] == R[t] && cand > t)) return;
	if (intersect(cur, cand)) t = cand;
}

set<pii> T[2121212];
int L[2121212];

struct SegTree {
	int n, base;

	void init(int _n) {
		n = _n;
		for (base = 1; base < n; base <<= 1);
		for (int i = base; i < base + base; i++) L[i] = i - base + 1;
		for (int i = base - 1; i >= 1; i--) L[i] = L[i << 1];
	}

	void chk_node(int idx, int y, int r, int li) {
		auto it = T[idx].lower_bound({y, 0});
		auto tmp = it;
		if (it != T[idx].end() && XL[it->second] > li) {
			chk(it->second);
			if (it->first < (long long)y + r + r) {
				it++;
				if (it != T[idx].end()) chk(it->second);
			}
		}
		// for (int i = 0; i < K; i++) {
		// 	if (it == T[idx].end()) break;
		// 	if (XL[it->second] <= li) break;
		// 	chk(it->second);
		// 	if (it->first >= (long long)y + r + r) break;
		// 	if (i < K - 1) it++;
		// }
		it = tmp;
		if (it != T[idx].begin()) {
			it--;
			if (XL[it->second] > li) {
				chk(it->second);
				if (it->first > (long long)y - r - r && it != T[idx].begin()) {
					chk(prev(it)->second);
				}
			}
		}
		// for (int i = 0; i < K; i++) {
		// 	if (it == T[idx].begin()) break;
		// 	it--;
		// 	if (XL[it->second] <= li) break;
		// 	chk(it->second);
		// 	if (it->first <= (long long)y - r - r) break;
		// }
	}

	void upd(int p, int q, pii x) {
		p += base; q += base;
		p--; q--;
		while (p <= q) {
			if (p & 1) T[p++].insert(x);
			if (~q & 1) T[q--].insert(x);
			p >>= 1; q >>= 1;
		}
	}

	void get(int p, int y, int r, int li) {
		p += base; p--;
		while (p >= 1) {
			if (L[p] <= li) break;
			chk_node(p, y, r, li);
			p >>= 1;
		}
	}
} seg;

int main() {
	rf(N);
	vector<int> v;
	for (int i = 1; i <= N; i++) {
		rf(X[i]); rf(Y[i]); rf(R[i]);
		XL[i] = X[i] - R[i], XR[i] = X[i] + R[i];
		v.push_back(XL[i]);
		v.push_back(XR[i]);
	}
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	for (int i = 1; i <= N; i++) {
		XL[i] = lower_bound(v.begin(), v.end(), XL[i]) - v.begin() + 1;
		XR[i] = lower_bound(v.begin(), v.end(), XR[i]) - v.begin() + 1;
	}

	int M = v.size();
	seg.init(M);

	vector<int> idx(N);
	iota(idx.begin(), idx.end(), 1);
	sort(idx.begin(), idx.end(), [&](int a, int b) {
		return pii(R[a], -a) > pii(R[b], -b);
	});

	for (int i : idx) {
		cur = i;
		ans[i] = i;
		seg.get(XL[i], Y[i], R[i], 0);
		seg.get(XR[i], Y[i], R[i], XL[i]);
		if (ans[i] == i) seg.upd(XL[i], XR[i], {Y[i], i});
	}

	for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
	return 0;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:141:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  141 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:141:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  141 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |                                                      ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 107096 KB Output is correct
2 Correct 21 ms 107100 KB Output is correct
3 Correct 22 ms 107100 KB Output is correct
4 Correct 21 ms 107100 KB Output is correct
5 Correct 22 ms 107112 KB Output is correct
6 Correct 23 ms 107100 KB Output is correct
7 Correct 22 ms 107100 KB Output is correct
8 Correct 22 ms 107100 KB Output is correct
9 Correct 22 ms 107108 KB Output is correct
10 Correct 22 ms 107152 KB Output is correct
11 Correct 21 ms 107064 KB Output is correct
12 Correct 22 ms 107100 KB Output is correct
13 Correct 22 ms 107100 KB Output is correct
14 Correct 21 ms 107100 KB Output is correct
15 Correct 22 ms 107128 KB Output is correct
16 Correct 22 ms 107100 KB Output is correct
17 Correct 24 ms 107352 KB Output is correct
18 Correct 23 ms 107096 KB Output is correct
19 Correct 26 ms 107352 KB Output is correct
20 Correct 24 ms 107356 KB Output is correct
21 Correct 24 ms 107356 KB Output is correct
22 Correct 27 ms 107868 KB Output is correct
23 Correct 30 ms 108380 KB Output is correct
24 Correct 25 ms 107612 KB Output is correct
25 Correct 25 ms 107612 KB Output is correct
26 Correct 26 ms 107612 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 121260 KB Output is correct
2 Correct 366 ms 121780 KB Output is correct
3 Correct 363 ms 121844 KB Output is correct
4 Correct 356 ms 122112 KB Output is correct
5 Correct 303 ms 121532 KB Output is correct
6 Correct 354 ms 132020 KB Output is correct
7 Correct 327 ms 124224 KB Output is correct
8 Correct 352 ms 126648 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 107352 KB Output is correct
2 Correct 254 ms 133824 KB Output is correct
3 Correct 910 ms 186648 KB Output is correct
4 Correct 938 ms 187832 KB Output is correct
5 Correct 1276 ms 185672 KB Output is correct
6 Correct 417 ms 137936 KB Output is correct
7 Correct 148 ms 120520 KB Output is correct
8 Correct 37 ms 110736 KB Output is correct
9 Correct 993 ms 190460 KB Output is correct
10 Correct 1497 ms 179480 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 703 ms 178948 KB Output is correct
2 Correct 316 ms 142260 KB Output is correct
3 Correct 704 ms 128948 KB Output is correct
4 Correct 360 ms 147432 KB Output is correct
5 Correct 325 ms 143540 KB Output is correct
6 Correct 552 ms 123172 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 107096 KB Output is correct
2 Correct 21 ms 107100 KB Output is correct
3 Correct 22 ms 107100 KB Output is correct
4 Correct 21 ms 107100 KB Output is correct
5 Correct 22 ms 107112 KB Output is correct
6 Correct 23 ms 107100 KB Output is correct
7 Correct 22 ms 107100 KB Output is correct
8 Correct 22 ms 107100 KB Output is correct
9 Correct 22 ms 107108 KB Output is correct
10 Correct 22 ms 107152 KB Output is correct
11 Correct 21 ms 107064 KB Output is correct
12 Correct 22 ms 107100 KB Output is correct
13 Correct 22 ms 107100 KB Output is correct
14 Correct 21 ms 107100 KB Output is correct
15 Correct 22 ms 107128 KB Output is correct
16 Correct 22 ms 107100 KB Output is correct
17 Correct 24 ms 107352 KB Output is correct
18 Correct 23 ms 107096 KB Output is correct
19 Correct 26 ms 107352 KB Output is correct
20 Correct 24 ms 107356 KB Output is correct
21 Correct 24 ms 107356 KB Output is correct
22 Correct 27 ms 107868 KB Output is correct
23 Correct 30 ms 108380 KB Output is correct
24 Correct 25 ms 107612 KB Output is correct
25 Correct 25 ms 107612 KB Output is correct
26 Correct 26 ms 107612 KB Output is correct
27 Correct 29 ms 109672 KB Output is correct
28 Correct 29 ms 109652 KB Output is correct
29 Correct 30 ms 109396 KB Output is correct
30 Correct 34 ms 111196 KB Output is correct
31 Correct 31 ms 110424 KB Output is correct
32 Correct 31 ms 110420 KB Output is correct
33 Correct 105 ms 111552 KB Output is correct
34 Correct 115 ms 111472 KB Output is correct
35 Correct 120 ms 111796 KB Output is correct
36 Correct 159 ms 124112 KB Output is correct
37 Correct 170 ms 124612 KB Output is correct
38 Correct 217 ms 126824 KB Output is correct
39 Correct 131 ms 112328 KB Output is correct
40 Correct 144 ms 112148 KB Output is correct
41 Correct 150 ms 112324 KB Output is correct
42 Correct 158 ms 112428 KB Output is correct
43 Correct 109 ms 118432 KB Output is correct
44 Correct 117 ms 117624 KB Output is correct
45 Correct 125 ms 118344 KB Output is correct
46 Correct 109 ms 118200 KB Output is correct
47 Correct 108 ms 117304 KB Output is correct
48 Correct 108 ms 118208 KB Output is correct
49 Correct 110 ms 116916 KB Output is correct
50 Correct 106 ms 117700 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 107096 KB Output is correct
2 Correct 21 ms 107100 KB Output is correct
3 Correct 22 ms 107100 KB Output is correct
4 Correct 21 ms 107100 KB Output is correct
5 Correct 22 ms 107112 KB Output is correct
6 Correct 23 ms 107100 KB Output is correct
7 Correct 22 ms 107100 KB Output is correct
8 Correct 22 ms 107100 KB Output is correct
9 Correct 22 ms 107108 KB Output is correct
10 Correct 22 ms 107152 KB Output is correct
11 Correct 21 ms 107064 KB Output is correct
12 Correct 22 ms 107100 KB Output is correct
13 Correct 22 ms 107100 KB Output is correct
14 Correct 21 ms 107100 KB Output is correct
15 Correct 22 ms 107128 KB Output is correct
16 Correct 22 ms 107100 KB Output is correct
17 Correct 24 ms 107352 KB Output is correct
18 Correct 23 ms 107096 KB Output is correct
19 Correct 26 ms 107352 KB Output is correct
20 Correct 24 ms 107356 KB Output is correct
21 Correct 24 ms 107356 KB Output is correct
22 Correct 27 ms 107868 KB Output is correct
23 Correct 30 ms 108380 KB Output is correct
24 Correct 25 ms 107612 KB Output is correct
25 Correct 25 ms 107612 KB Output is correct
26 Correct 26 ms 107612 KB Output is correct
27 Correct 378 ms 121260 KB Output is correct
28 Correct 366 ms 121780 KB Output is correct
29 Correct 363 ms 121844 KB Output is correct
30 Correct 356 ms 122112 KB Output is correct
31 Correct 303 ms 121532 KB Output is correct
32 Correct 354 ms 132020 KB Output is correct
33 Correct 327 ms 124224 KB Output is correct
34 Correct 352 ms 126648 KB Output is correct
35 Correct 21 ms 107352 KB Output is correct
36 Correct 254 ms 133824 KB Output is correct
37 Correct 910 ms 186648 KB Output is correct
38 Correct 938 ms 187832 KB Output is correct
39 Correct 1276 ms 185672 KB Output is correct
40 Correct 417 ms 137936 KB Output is correct
41 Correct 148 ms 120520 KB Output is correct
42 Correct 37 ms 110736 KB Output is correct
43 Correct 993 ms 190460 KB Output is correct
44 Correct 1497 ms 179480 KB Output is correct
45 Correct 703 ms 178948 KB Output is correct
46 Correct 316 ms 142260 KB Output is correct
47 Correct 704 ms 128948 KB Output is correct
48 Correct 360 ms 147432 KB Output is correct
49 Correct 325 ms 143540 KB Output is correct
50 Correct 552 ms 123172 KB Output is correct
51 Correct 29 ms 109672 KB Output is correct
52 Correct 29 ms 109652 KB Output is correct
53 Correct 30 ms 109396 KB Output is correct
54 Correct 34 ms 111196 KB Output is correct
55 Correct 31 ms 110424 KB Output is correct
56 Correct 31 ms 110420 KB Output is correct
57 Correct 105 ms 111552 KB Output is correct
58 Correct 115 ms 111472 KB Output is correct
59 Correct 120 ms 111796 KB Output is correct
60 Correct 159 ms 124112 KB Output is correct
61 Correct 170 ms 124612 KB Output is correct
62 Correct 217 ms 126824 KB Output is correct
63 Correct 131 ms 112328 KB Output is correct
64 Correct 144 ms 112148 KB Output is correct
65 Correct 150 ms 112324 KB Output is correct
66 Correct 158 ms 112428 KB Output is correct
67 Correct 109 ms 118432 KB Output is correct
68 Correct 117 ms 117624 KB Output is correct
69 Correct 125 ms 118344 KB Output is correct
70 Correct 109 ms 118200 KB Output is correct
71 Correct 108 ms 117304 KB Output is correct
72 Correct 108 ms 118208 KB Output is correct
73 Correct 110 ms 116916 KB Output is correct
74 Correct 106 ms 117700 KB Output is correct
75 Correct 382 ms 120776 KB Output is correct
76 Correct 381 ms 122136 KB Output is correct
77 Correct 351 ms 121012 KB Output is correct
78 Correct 359 ms 121528 KB Output is correct
79 Correct 460 ms 121912 KB Output is correct
80 Correct 392 ms 121528 KB Output is correct
81 Correct 867 ms 183208 KB Output is correct
82 Correct 727 ms 174216 KB Output is correct
83 Correct 776 ms 173152 KB Output is correct
84 Correct 1259 ms 197476 KB Output is correct
85 Correct 824 ms 178812 KB Output is correct
86 Correct 684 ms 171884 KB Output is correct
87 Correct 2578 ms 241300 KB Output is correct
88 Correct 402 ms 125032 KB Output is correct
89 Correct 439 ms 123852 KB Output is correct
90 Correct 475 ms 123284 KB Output is correct
91 Correct 413 ms 124196 KB Output is correct
92 Correct 444 ms 123488 KB Output is correct
93 Correct 345 ms 142264 KB Output is correct
94 Correct 2633 ms 193100 KB Output is correct
95 Correct 335 ms 143284 KB Output is correct
96 Correct 369 ms 144352 KB Output is correct
97 Correct 2167 ms 167320 KB Output is correct
98 Correct 378 ms 135568 KB Output is correct
99 Correct 348 ms 142352 KB Output is correct
100 Correct 324 ms 144044 KB Output is correct
101 Correct 490 ms 145048 KB Output is correct
102 Correct 365 ms 142016 KB Output is correct
103 Execution timed out 3069 ms 185192 KB Time limit exceeded
104 Halted 0 ms 0 KB -