oj.uz

Submission #855756

# Submission time Handle Problem Language Result Execution time Memory
855756 2023-10-01T18:02:44 Z dlalswp25 Circle selection (APIO18_circle_selection) C++17
87 / 100
 3000 ms 239708 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, int li) {
		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 && XL[it->second] > li) {
				++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() && XL[it->second] > li) {
				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, li);
			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 6744 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 5 ms 8280 KB Output is correct
20 Correct 4 ms 8532 KB Output is correct
21 Correct 4 ms 8284 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 9 ms 9564 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 4 ms 8508 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 370 ms 120348 KB Output is correct
2 Correct 365 ms 121268 KB Output is correct
3 Correct 361 ms 120456 KB Output is correct
4 Correct 354 ms 121032 KB Output is correct
5 Correct 295 ms 67996 KB Output is correct
6 Correct 352 ms 132280 KB Output is correct
7 Correct 327 ms 122972 KB Output is correct
8 Correct 344 ms 126036 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 259 ms 57540 KB Output is correct
3 Correct 942 ms 186944 KB Output is correct
4 Correct 929 ms 185616 KB Output is correct
5 Correct 1180 ms 184092 KB Output is correct
6 Correct 379 ms 85948 KB Output is correct
7 Correct 121 ms 44224 KB Output is correct
8 Correct 15 ms 14552 KB Output is correct
9 Correct 1000 ms 189300 KB Output is correct
10 Correct 1457 ms 177900 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 641 ms 177060 KB Output is correct
2 Correct 307 ms 141232 KB Output is correct
3 Correct 618 ms 127924 KB Output is correct
4 Correct 352 ms 144844 KB Output is correct
5 Correct 317 ms 142940 KB Output is correct
6 Correct 569 ms 121260 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 6744 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 5 ms 8280 KB Output is correct
20 Correct 4 ms 8532 KB Output is correct
21 Correct 4 ms 8284 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 9 ms 9564 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 4 ms 8508 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 8 ms 10076 KB Output is correct
28 Correct 7 ms 10076 KB Output is correct
29 Correct 8 ms 10076 KB Output is correct
30 Correct 13 ms 11768 KB Output is correct
31 Correct 10 ms 11100 KB Output is correct
32 Correct 10 ms 11100 KB Output is correct
33 Correct 89 ms 35152 KB Output is correct
34 Correct 97 ms 35192 KB Output is correct
35 Correct 99 ms 35172 KB Output is correct
36 Correct 138 ms 47812 KB Output is correct
37 Correct 145 ms 48320 KB Output is correct
38 Correct 157 ms 50560 KB Output is correct
39 Correct 112 ms 11460 KB Output is correct
40 Correct 122 ms 11456 KB Output is correct
41 Correct 106 ms 11360 KB Output is correct
42 Correct 110 ms 11700 KB Output is correct
43 Correct 91 ms 42076 KB Output is correct
44 Correct 90 ms 41308 KB Output is correct
45 Correct 89 ms 41804 KB Output is correct
46 Correct 96 ms 41884 KB Output is correct
47 Correct 91 ms 41048 KB Output is correct
48 Correct 89 ms 41920 KB Output is correct
49 Correct 85 ms 40544 KB Output is correct
50 Correct 90 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 6744 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 5 ms 8280 KB Output is correct
20 Correct 4 ms 8532 KB Output is correct
21 Correct 4 ms 8284 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 9 ms 9564 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 4 ms 8508 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 370 ms 120348 KB Output is correct
28 Correct 365 ms 121268 KB Output is correct
29 Correct 361 ms 120456 KB Output is correct
30 Correct 354 ms 121032 KB Output is correct
31 Correct 295 ms 67996 KB Output is correct
32 Correct 352 ms 132280 KB Output is correct
33 Correct 327 ms 122972 KB Output is correct
34 Correct 344 ms 126036 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 259 ms 57540 KB Output is correct
37 Correct 942 ms 186944 KB Output is correct
38 Correct 929 ms 185616 KB Output is correct
39 Correct 1180 ms 184092 KB Output is correct
40 Correct 379 ms 85948 KB Output is correct
41 Correct 121 ms 44224 KB Output is correct
42 Correct 15 ms 14552 KB Output is correct
43 Correct 1000 ms 189300 KB Output is correct
44 Correct 1457 ms 177900 KB Output is correct
45 Correct 641 ms 177060 KB Output is correct
46 Correct 307 ms 141232 KB Output is correct
47 Correct 618 ms 127924 KB Output is correct
48 Correct 352 ms 144844 KB Output is correct
49 Correct 317 ms 142940 KB Output is correct
50 Correct 569 ms 121260 KB Output is correct
51 Correct 8 ms 10076 KB Output is correct
52 Correct 7 ms 10076 KB Output is correct
53 Correct 8 ms 10076 KB Output is correct
54 Correct 13 ms 11768 KB Output is correct
55 Correct 10 ms 11100 KB Output is correct
56 Correct 10 ms 11100 KB Output is correct
57 Correct 89 ms 35152 KB Output is correct
58 Correct 97 ms 35192 KB Output is correct
59 Correct 99 ms 35172 KB Output is correct
60 Correct 138 ms 47812 KB Output is correct
61 Correct 145 ms 48320 KB Output is correct
62 Correct 157 ms 50560 KB Output is correct
63 Correct 112 ms 11460 KB Output is correct
64 Correct 122 ms 11456 KB Output is correct
65 Correct 106 ms 11360 KB Output is correct
66 Correct 110 ms 11700 KB Output is correct
67 Correct 91 ms 42076 KB Output is correct
68 Correct 90 ms 41308 KB Output is correct
69 Correct 89 ms 41804 KB Output is correct
70 Correct 96 ms 41884 KB Output is correct
71 Correct 91 ms 41048 KB Output is correct
72 Correct 89 ms 41920 KB Output is correct
73 Correct 85 ms 40544 KB Output is correct
74 Correct 90 ms 41412 KB Output is correct
75 Correct 372 ms 119748 KB Output is correct
76 Correct 378 ms 120128 KB Output is correct
77 Correct 316 ms 119828 KB Output is correct
78 Correct 338 ms 120504 KB Output is correct
79 Correct 416 ms 120208 KB Output is correct
80 Correct 345 ms 120244 KB Output is correct
81 Correct 841 ms 181512 KB Output is correct
82 Correct 666 ms 171448 KB Output is correct
83 Correct 672 ms 173320 KB Output is correct
84 Correct 1110 ms 196276 KB Output is correct
85 Correct 800 ms 177880 KB Output is correct
86 Correct 709 ms 170952 KB Output is correct
87 Correct 2565 ms 239708 KB Output is correct
88 Correct 378 ms 23620 KB Output is correct
89 Correct 363 ms 21944 KB Output is correct
90 Correct 439 ms 23048 KB Output is correct
91 Correct 418 ms 22880 KB Output is correct
92 Correct 361 ms 22964 KB Output is correct
93 Correct 347 ms 142264 KB Output is correct
94 Correct 2878 ms 90544 KB Output is correct
95 Correct 337 ms 141192 KB Output is correct
96 Correct 361 ms 141720 KB Output is correct
97 Correct 1994 ms 67284 KB Output is correct
98 Correct 385 ms 132948 KB Output is correct
99 Correct 353 ms 141440 KB Output is correct
100 Correct 317 ms 142780 KB Output is correct
101 Correct 480 ms 144056 KB Output is correct
102 Correct 365 ms 141372 KB Output is correct
103 Execution timed out 3049 ms 87008 KB Time limit exceeded
104 Halted 0 ms 0 KB -