oj.uz

Submission #851538

# Submission time Handle Problem Language Result Execution time Memory
851538 2023-09-20T04:53:30 Z dlalswp25 Circle selection (APIO18_circle_selection) C++17
87 / 100
 3000 ms 240100 KB 
#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 (pii(R[cand], -cand) < pii(R[t], -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 idxl, int idxr, int y, int r) {
		auto itl = T[idxl].s.lower_bound({y, 0});
		auto itr = T[idxr].s.lower_bound({y, 0});
		auto tmpl = itl, tmpr = itr;
		if (idxl == idxr) {
			for (int i = 0; i < 3; i++) {
				if (itl == T[idxl].s.end()) break;
				chk(itl->second);
				// if (itl->first >= (long long)y + r + r) break;
				if (i < 2) itl++;
			}
		} else {
			for (int i = 0; i < 3; i++) {
				bool fl = (itl == T[idxl].s.end());
				bool fr = (itr == T[idxr].s.end());
				if (fl && fr) break;
				if (fr || (!fl && itl->first < itr->first)) {
					chk(itl->second);
					if (i < 2) itl++;
				} else {
					chk(itr->second);
					if (i < 2) itr++;
				}
			}
		}
		itl = tmpl; itr = tmpr;
		if (idxl == idxr) {
			for (int i = 0; i < 3; i++) {
				if (itl == T[idxl].s.begin()) break;
				itl--;
				chk(itl->second);
				// if (itl->first <= (long long)y - r - r) break;
			}
		} else {
			for (int i = 0; i < 3; i++) {
				bool fl = (itl == T[idxl].s.begin());
				bool fr = (itr == T[idxr].s.begin());
				if (fl && fr) break;
				if (fr || (!fl && prev(itl)->first > prev(itr)->first)) {
					itl--;
					chk(itl->second);
				} else {
					itr--;
					chk(itr->second);
				}
			}
		}

		// auto it = T[idx].s.lower_bound({y, 0});
		// auto tmp = it;
		// for (int i = 0; i < K; i++) {
		// 	if (it == T[idx].s.end()) break;
		// 	chk(it->second);
		// 	if (it->first >= (long long)y + r + r) break;
		// 	if (i < K - 1) it++;
		// }
		// it = tmp;
		// for (int i = 0; i < K; i++) {
		// 	if (it == T[idx].s.begin()) break;
		// 	it--;
		// 	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 q, int y, int r) {
		p += base; q += base;
		p--; q--;
		while (p > 1) {
			chk_node(p, q, y, r);
			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);
	// 		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], XR[i], Y[i], R[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:183:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  183 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:183:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  183 |  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 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 2 ms 6488 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 1 ms 6744 KB Output is correct
18 Correct 1 ms 6744 KB Output is correct
19 Correct 4 ms 8280 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 6 ms 8280 KB Output is correct
22 Correct 5 ms 8792 KB Output is correct
23 Correct 10 ms 9816 KB Output is correct
24 Correct 5 ms 8792 KB Output is correct
25 Correct 5 ms 8536 KB Output is correct
26 Correct 5 ms 8792 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 121012 KB Output is correct
2 Correct 339 ms 121544 KB Output is correct
3 Correct 347 ms 120204 KB Output is correct
4 Correct 340 ms 120756 KB Output is correct
5 Correct 292 ms 68280 KB Output is correct
6 Correct 355 ms 130484 KB Output is correct
7 Correct 344 ms 123168 KB Output is correct
8 Correct 348 ms 126056 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 272 ms 57284 KB Output is correct
3 Correct 1022 ms 186308 KB Output is correct
4 Correct 1050 ms 185416 KB Output is correct
5 Correct 1373 ms 183216 KB Output is correct
6 Correct 457 ms 86192 KB Output is correct
7 Correct 137 ms 44228 KB Output is correct
8 Correct 16 ms 14548 KB Output is correct
9 Correct 1141 ms 188596 KB Output is correct
10 Correct 1831 ms 179540 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 703 ms 177332 KB Output is correct
2 Correct 315 ms 141704 KB Output is correct
3 Correct 824 ms 128956 KB Output is correct
4 Correct 346 ms 145332 KB Output is correct
5 Correct 326 ms 142324 KB Output is correct
6 Correct 700 ms 121256 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 2 ms 6488 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 1 ms 6744 KB Output is correct
18 Correct 1 ms 6744 KB Output is correct
19 Correct 4 ms 8280 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 6 ms 8280 KB Output is correct
22 Correct 5 ms 8792 KB Output is correct
23 Correct 10 ms 9816 KB Output is correct
24 Correct 5 ms 8792 KB Output is correct
25 Correct 5 ms 8536 KB Output is correct
26 Correct 5 ms 8792 KB Output is correct
27 Correct 9 ms 10072 KB Output is correct
28 Correct 8 ms 10072 KB Output is correct
29 Correct 8 ms 10076 KB Output is correct
30 Correct 14 ms 11864 KB Output is correct
31 Correct 10 ms 11096 KB Output is correct
32 Correct 9 ms 11096 KB Output is correct
33 Correct 88 ms 35148 KB Output is correct
34 Correct 92 ms 35160 KB Output is correct
35 Correct 94 ms 35152 KB Output is correct
36 Correct 143 ms 47808 KB Output is correct
37 Correct 153 ms 48596 KB Output is correct
38 Correct 164 ms 50372 KB Output is correct
39 Correct 148 ms 11604 KB Output is correct
40 Correct 139 ms 11456 KB Output is correct
41 Correct 139 ms 11512 KB Output is correct
42 Correct 153 ms 11720 KB Output is correct
43 Correct 98 ms 41924 KB Output is correct
44 Correct 94 ms 41312 KB Output is correct
45 Correct 96 ms 41924 KB Output is correct
46 Correct 97 ms 41920 KB Output is correct
47 Correct 92 ms 40960 KB Output is correct
48 Correct 92 ms 41900 KB Output is correct
49 Correct 93 ms 40784 KB Output is correct
50 Correct 92 ms 41408 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 2 ms 6488 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 1 ms 6744 KB Output is correct
18 Correct 1 ms 6744 KB Output is correct
19 Correct 4 ms 8280 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 6 ms 8280 KB Output is correct
22 Correct 5 ms 8792 KB Output is correct
23 Correct 10 ms 9816 KB Output is correct
24 Correct 5 ms 8792 KB Output is correct
25 Correct 5 ms 8536 KB Output is correct
26 Correct 5 ms 8792 KB Output is correct
27 Correct 333 ms 121012 KB Output is correct
28 Correct 339 ms 121544 KB Output is correct
29 Correct 347 ms 120204 KB Output is correct
30 Correct 340 ms 120756 KB Output is correct
31 Correct 292 ms 68280 KB Output is correct
32 Correct 355 ms 130484 KB Output is correct
33 Correct 344 ms 123168 KB Output is correct
34 Correct 348 ms 126056 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 272 ms 57284 KB Output is correct
37 Correct 1022 ms 186308 KB Output is correct
38 Correct 1050 ms 185416 KB Output is correct
39 Correct 1373 ms 183216 KB Output is correct
40 Correct 457 ms 86192 KB Output is correct
41 Correct 137 ms 44228 KB Output is correct
42 Correct 16 ms 14548 KB Output is correct
43 Correct 1141 ms 188596 KB Output is correct
44 Correct 1831 ms 179540 KB Output is correct
45 Correct 703 ms 177332 KB Output is correct
46 Correct 315 ms 141704 KB Output is correct
47 Correct 824 ms 128956 KB Output is correct
48 Correct 346 ms 145332 KB Output is correct
49 Correct 326 ms 142324 KB Output is correct
50 Correct 700 ms 121256 KB Output is correct
51 Correct 9 ms 10072 KB Output is correct
52 Correct 8 ms 10072 KB Output is correct
53 Correct 8 ms 10076 KB Output is correct
54 Correct 14 ms 11864 KB Output is correct
55 Correct 10 ms 11096 KB Output is correct
56 Correct 9 ms 11096 KB Output is correct
57 Correct 88 ms 35148 KB Output is correct
58 Correct 92 ms 35160 KB Output is correct
59 Correct 94 ms 35152 KB Output is correct
60 Correct 143 ms 47808 KB Output is correct
61 Correct 153 ms 48596 KB Output is correct
62 Correct 164 ms 50372 KB Output is correct
63 Correct 148 ms 11604 KB Output is correct
64 Correct 139 ms 11456 KB Output is correct
65 Correct 139 ms 11512 KB Output is correct
66 Correct 153 ms 11720 KB Output is correct
67 Correct 98 ms 41924 KB Output is correct
68 Correct 94 ms 41312 KB Output is correct
69 Correct 96 ms 41924 KB Output is correct
70 Correct 97 ms 41920 KB Output is correct
71 Correct 92 ms 40960 KB Output is correct
72 Correct 92 ms 41900 KB Output is correct
73 Correct 93 ms 40784 KB Output is correct
74 Correct 92 ms 41408 KB Output is correct
75 Correct 345 ms 120028 KB Output is correct
76 Correct 346 ms 120160 KB Output is correct
77 Correct 335 ms 120732 KB Output is correct
78 Correct 333 ms 120144 KB Output is correct
79 Correct 450 ms 121912 KB Output is correct
80 Correct 331 ms 119476 KB Output is correct
81 Correct 898 ms 180916 KB Output is correct
82 Correct 729 ms 171340 KB Output is correct
83 Correct 756 ms 172620 KB Output is correct
84 Correct 1293 ms 197156 KB Output is correct
85 Correct 845 ms 178836 KB Output is correct
86 Correct 705 ms 170184 KB Output is correct
87 Execution timed out 3012 ms 240100 KB Time limit exceeded
88 Halted 0 ms 0 KB -