oj.uz

Submission #855760

# Submission time Handle Problem Language Result Execution time Memory
855760 2023-10-01T18:11:06 Z dlalswp25 Circle selection (APIO18_circle_selection) C++17
87 / 100
 3000 ms 240232 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#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;
}

struct SegTree {
	struct Node {
		set<pii> s;
	};

	int n, base;
	vector<Node> T;
	vector<int> L;

	SegTree(int _n) : n(_n) {
		for (base = 1; base < n; base <<= 1);
		T.resize(base + base);
		L.resize(base + base);
		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) {
		auto it = T[idx].s.lower_bound({y, 0});
		auto tmp = it;
		if (it != T[idx].s.end()) {
			chk(it->second);
			if (it->first - y < r) {
				++it;
				if (it != T[idx].s.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].s.begin()) {
			--it;
			chk(it->second);
			if (it->first - y > -r && it != T[idx].s.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++].s.insert(x);
			if (~q & 1) T[q--].s.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 << 1);
			p >>= 1;
		}
	}
};

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();
	SegTree seg(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:144:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  144 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:144:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  144 |  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 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 4 ms 8284 KB Output is correct
20 Correct 4 ms 8284 KB Output is correct
21 Correct 4 ms 8284 KB Output is correct
22 Correct 5 ms 8932 KB Output is correct
23 Correct 9 ms 9532 KB Output is correct
24 Correct 5 ms 8752 KB Output is correct
25 Correct 4 ms 8492 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 403 ms 120800 KB Output is correct
2 Correct 355 ms 120508 KB Output is correct
3 Correct 365 ms 119564 KB Output is correct
4 Correct 353 ms 121016 KB Output is correct
5 Correct 293 ms 68008 KB Output is correct
6 Correct 351 ms 130444 KB Output is correct
7 Correct 342 ms 123084 KB Output is correct
8 Correct 350 ms 124600 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 234 ms 57436 KB Output is correct
3 Correct 936 ms 185840 KB Output is correct
4 Correct 896 ms 186380 KB Output is correct
5 Correct 1206 ms 183472 KB Output is correct
6 Correct 421 ms 85944 KB Output is correct
7 Correct 125 ms 44224 KB Output is correct
8 Correct 16 ms 14552 KB Output is correct
9 Correct 1012 ms 189140 KB Output is correct
10 Correct 1497 ms 178844 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 709 ms 177944 KB Output is correct
2 Correct 339 ms 141924 KB Output is correct
3 Correct 607 ms 127924 KB Output is correct
4 Correct 347 ms 144824 KB Output is correct
5 Correct 316 ms 142256 KB Output is correct
6 Correct 541 ms 121268 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 4 ms 8284 KB Output is correct
20 Correct 4 ms 8284 KB Output is correct
21 Correct 4 ms 8284 KB Output is correct
22 Correct 5 ms 8932 KB Output is correct
23 Correct 9 ms 9532 KB Output is correct
24 Correct 5 ms 8752 KB Output is correct
25 Correct 4 ms 8492 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 8 ms 10076 KB Output is correct
28 Correct 8 ms 10076 KB Output is correct
29 Correct 8 ms 10148 KB Output is correct
30 Correct 13 ms 11868 KB Output is correct
31 Correct 10 ms 11176 KB Output is correct
32 Correct 10 ms 11100 KB Output is correct
33 Correct 102 ms 35152 KB Output is correct
34 Correct 97 ms 35016 KB Output is correct
35 Correct 99 ms 35172 KB Output is correct
36 Correct 135 ms 47808 KB Output is correct
37 Correct 149 ms 48324 KB Output is correct
38 Correct 158 ms 50376 KB Output is correct
39 Correct 107 ms 11360 KB Output is correct
40 Correct 112 ms 11604 KB Output is correct
41 Correct 106 ms 11580 KB Output is correct
42 Correct 113 ms 11720 KB Output is correct
43 Correct 95 ms 41932 KB Output is correct
44 Correct 88 ms 41364 KB Output is correct
45 Correct 99 ms 41832 KB Output is correct
46 Correct 92 ms 41928 KB Output is correct
47 Correct 95 ms 40904 KB Output is correct
48 Correct 89 ms 41924 KB Output is correct
49 Correct 86 ms 40548 KB Output is correct
50 Correct 87 ms 41412 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 4 ms 8284 KB Output is correct
20 Correct 4 ms 8284 KB Output is correct
21 Correct 4 ms 8284 KB Output is correct
22 Correct 5 ms 8932 KB Output is correct
23 Correct 9 ms 9532 KB Output is correct
24 Correct 5 ms 8752 KB Output is correct
25 Correct 4 ms 8492 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 403 ms 120800 KB Output is correct
28 Correct 355 ms 120508 KB Output is correct
29 Correct 365 ms 119564 KB Output is correct
30 Correct 353 ms 121016 KB Output is correct
31 Correct 293 ms 68008 KB Output is correct
32 Correct 351 ms 130444 KB Output is correct
33 Correct 342 ms 123084 KB Output is correct
34 Correct 350 ms 124600 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 234 ms 57436 KB Output is correct
37 Correct 936 ms 185840 KB Output is correct
38 Correct 896 ms 186380 KB Output is correct
39 Correct 1206 ms 183472 KB Output is correct
40 Correct 421 ms 85944 KB Output is correct
41 Correct 125 ms 44224 KB Output is correct
42 Correct 16 ms 14552 KB Output is correct
43 Correct 1012 ms 189140 KB Output is correct
44 Correct 1497 ms 178844 KB Output is correct
45 Correct 709 ms 177944 KB Output is correct
46 Correct 339 ms 141924 KB Output is correct
47 Correct 607 ms 127924 KB Output is correct
48 Correct 347 ms 144824 KB Output is correct
49 Correct 316 ms 142256 KB Output is correct
50 Correct 541 ms 121268 KB Output is correct
51 Correct 8 ms 10076 KB Output is correct
52 Correct 8 ms 10076 KB Output is correct
53 Correct 8 ms 10148 KB Output is correct
54 Correct 13 ms 11868 KB Output is correct
55 Correct 10 ms 11176 KB Output is correct
56 Correct 10 ms 11100 KB Output is correct
57 Correct 102 ms 35152 KB Output is correct
58 Correct 97 ms 35016 KB Output is correct
59 Correct 99 ms 35172 KB Output is correct
60 Correct 135 ms 47808 KB Output is correct
61 Correct 149 ms 48324 KB Output is correct
62 Correct 158 ms 50376 KB Output is correct
63 Correct 107 ms 11360 KB Output is correct
64 Correct 112 ms 11604 KB Output is correct
65 Correct 106 ms 11580 KB Output is correct
66 Correct 113 ms 11720 KB Output is correct
67 Correct 95 ms 41932 KB Output is correct
68 Correct 88 ms 41364 KB Output is correct
69 Correct 99 ms 41832 KB Output is correct
70 Correct 92 ms 41928 KB Output is correct
71 Correct 95 ms 40904 KB Output is correct
72 Correct 89 ms 41924 KB Output is correct
73 Correct 86 ms 40548 KB Output is correct
74 Correct 87 ms 41412 KB Output is correct
75 Correct 372 ms 121016 KB Output is correct
76 Correct 394 ms 120044 KB Output is correct
77 Correct 325 ms 119820 KB Output is correct
78 Correct 347 ms 120764 KB Output is correct
79 Correct 426 ms 121528 KB Output is correct
80 Correct 365 ms 121096 KB Output is correct
81 Correct 824 ms 181352 KB Output is correct
82 Correct 685 ms 173196 KB Output is correct
83 Correct 697 ms 172772 KB Output is correct
84 Correct 1117 ms 195432 KB Output is correct
85 Correct 764 ms 178696 KB Output is correct
86 Correct 679 ms 171224 KB Output is correct
87 Correct 2459 ms 240232 KB Output is correct
88 Correct 364 ms 22712 KB Output is correct
89 Correct 383 ms 21888 KB Output is correct
90 Correct 366 ms 23424 KB Output is correct
91 Correct 379 ms 22724 KB Output is correct
92 Correct 361 ms 21932 KB Output is correct
93 Correct 354 ms 140984 KB Output is correct
94 Correct 2800 ms 89888 KB Output is correct
95 Correct 330 ms 142008 KB Output is correct
96 Correct 363 ms 141400 KB Output is correct
97 Correct 2033 ms 67512 KB Output is correct
98 Correct 373 ms 133332 KB Output is correct
99 Correct 340 ms 141576 KB Output is correct
100 Correct 335 ms 141196 KB Output is correct
101 Correct 487 ms 145356 KB Output is correct
102 Correct 344 ms 141988 KB Output is correct
103 Execution timed out 3082 ms 87976 KB Time limit exceeded
104 Halted 0 ms 0 KB -