oj.uz

답안 #856043

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
856043 2023-10-02T15:39:44 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
100 / 100
 1393 ms 201396 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;
}

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];
	}

	inline 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> vx, vy;
	for (int i = 1; i <= N; i++) {
		rf(X[i]); rf(Y[i]); rf(R[i]);
		vx.push_back(X[i] - R[i]); vx.push_back(X[i] + R[i]);
		vy.push_back(Y[i] - R[i]); vy.push_back(Y[i] + R[i]);
	}
	sort(vx.begin(), vx.end());
	vx.erase(unique(vx.begin(), vx.end()), vx.end());
	sort(vy.begin(), vy.end());
	vy.erase(unique(vy.begin(), vy.end()), vy.end());
	vector<int> v;
	if (vx.size() < vy.size()) {
		for (int i = 1; i <= N; i++) swap(X[i], Y[i]);
		v = vy;
	} else {
		v = vx;
	}
	for (int i = 1; i <= N; i++) {
		XL[i] = lower_bound(v.begin(), v.end(), X[i] - R[i]) - v.begin() + 1;
		XR[i] = lower_bound(v.begin(), v.end(), X[i] + R[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:151:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  151 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:151:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  151 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |                                                      ^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 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 6488 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 6492 KB Output is correct
13 Correct 1 ms 6744 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 6 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 5 ms 8536 KB Output is correct
23 Correct 5 ms 8796 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 6 ms 8792 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 400 ms 126172 KB Output is correct
2 Correct 402 ms 125856 KB Output is correct
3 Correct 400 ms 125408 KB Output is correct
4 Correct 406 ms 127148 KB Output is correct
5 Correct 311 ms 73380 KB Output is correct
6 Correct 386 ms 136880 KB Output is correct
7 Correct 355 ms 128384 KB Output is correct
8 Correct 364 ms 131484 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 255 ms 58812 KB Output is correct
3 Correct 939 ms 192104 KB Output is correct
4 Correct 943 ms 190120 KB Output is correct
5 Correct 1222 ms 190012 KB Output is correct
6 Correct 421 ms 88536 KB Output is correct
7 Correct 134 ms 45500 KB Output is correct
8 Correct 18 ms 14804 KB Output is correct
9 Correct 1018 ms 192372 KB Output is correct
10 Correct 1393 ms 181696 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 617 ms 175412 KB Output is correct
2 Correct 348 ms 145968 KB Output is correct
3 Correct 651 ms 133408 KB Output is correct
4 Correct 372 ms 149372 KB Output is correct
5 Correct 359 ms 148900 KB Output is correct
6 Correct 505 ms 127804 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 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 6488 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 6492 KB Output is correct
13 Correct 1 ms 6744 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 6 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 5 ms 8536 KB Output is correct
23 Correct 5 ms 8796 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 6 ms 8792 KB Output is correct
27 Correct 11 ms 10332 KB Output is correct
28 Correct 9 ms 10332 KB Output is correct
29 Correct 9 ms 10236 KB Output is correct
30 Correct 10 ms 10844 KB Output is correct
31 Correct 11 ms 11356 KB Output is correct
32 Correct 11 ms 11100 KB Output is correct
33 Correct 102 ms 36796 KB Output is correct
34 Correct 105 ms 36788 KB Output is correct
35 Correct 114 ms 36800 KB Output is correct
36 Correct 165 ms 49868 KB Output is correct
37 Correct 138 ms 47800 KB Output is correct
38 Correct 180 ms 51908 KB Output is correct
39 Correct 116 ms 12460 KB Output is correct
40 Correct 114 ms 12220 KB Output is correct
41 Correct 114 ms 12244 KB Output is correct
42 Correct 122 ms 12488 KB Output is correct
43 Correct 106 ms 43720 KB Output is correct
44 Correct 103 ms 43724 KB Output is correct
45 Correct 104 ms 43416 KB Output is correct
46 Correct 101 ms 42680 KB Output is correct
47 Correct 102 ms 42424 KB Output is correct
48 Correct 101 ms 43484 KB Output is correct
49 Correct 101 ms 42680 KB Output is correct
50 Correct 102 ms 42944 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 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 6488 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 6492 KB Output is correct
13 Correct 1 ms 6744 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 6 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 5 ms 8536 KB Output is correct
23 Correct 5 ms 8796 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 6 ms 8792 KB Output is correct
27 Correct 400 ms 126172 KB Output is correct
28 Correct 402 ms 125856 KB Output is correct
29 Correct 400 ms 125408 KB Output is correct
30 Correct 406 ms 127148 KB Output is correct
31 Correct 311 ms 73380 KB Output is correct
32 Correct 386 ms 136880 KB Output is correct
33 Correct 355 ms 128384 KB Output is correct
34 Correct 364 ms 131484 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 255 ms 58812 KB Output is correct
37 Correct 939 ms 192104 KB Output is correct
38 Correct 943 ms 190120 KB Output is correct
39 Correct 1222 ms 190012 KB Output is correct
40 Correct 421 ms 88536 KB Output is correct
41 Correct 134 ms 45500 KB Output is correct
42 Correct 18 ms 14804 KB Output is correct
43 Correct 1018 ms 192372 KB Output is correct
44 Correct 1393 ms 181696 KB Output is correct
45 Correct 617 ms 175412 KB Output is correct
46 Correct 348 ms 145968 KB Output is correct
47 Correct 651 ms 133408 KB Output is correct
48 Correct 372 ms 149372 KB Output is correct
49 Correct 359 ms 148900 KB Output is correct
50 Correct 505 ms 127804 KB Output is correct
51 Correct 11 ms 10332 KB Output is correct
52 Correct 9 ms 10332 KB Output is correct
53 Correct 9 ms 10236 KB Output is correct
54 Correct 10 ms 10844 KB Output is correct
55 Correct 11 ms 11356 KB Output is correct
56 Correct 11 ms 11100 KB Output is correct
57 Correct 102 ms 36796 KB Output is correct
58 Correct 105 ms 36788 KB Output is correct
59 Correct 114 ms 36800 KB Output is correct
60 Correct 165 ms 49868 KB Output is correct
61 Correct 138 ms 47800 KB Output is correct
62 Correct 180 ms 51908 KB Output is correct
63 Correct 116 ms 12460 KB Output is correct
64 Correct 114 ms 12220 KB Output is correct
65 Correct 114 ms 12244 KB Output is correct
66 Correct 122 ms 12488 KB Output is correct
67 Correct 106 ms 43720 KB Output is correct
68 Correct 103 ms 43724 KB Output is correct
69 Correct 104 ms 43416 KB Output is correct
70 Correct 101 ms 42680 KB Output is correct
71 Correct 102 ms 42424 KB Output is correct
72 Correct 101 ms 43484 KB Output is correct
73 Correct 101 ms 42680 KB Output is correct
74 Correct 102 ms 42944 KB Output is correct
75 Correct 412 ms 126692 KB Output is correct
76 Correct 402 ms 125600 KB Output is correct
77 Correct 386 ms 126272 KB Output is correct
78 Correct 387 ms 124956 KB Output is correct
79 Correct 463 ms 125348 KB Output is correct
80 Correct 409 ms 125004 KB Output is correct
81 Correct 807 ms 182256 KB Output is correct
82 Correct 742 ms 177064 KB Output is correct
83 Correct 736 ms 178340 KB Output is correct
84 Correct 1192 ms 201396 KB Output is correct
85 Correct 810 ms 181588 KB Output is correct
86 Correct 706 ms 175000 KB Output is correct
87 Correct 892 ms 186844 KB Output is correct
88 Correct 388 ms 26400 KB Output is correct
89 Correct 393 ms 25092 KB Output is correct
90 Correct 390 ms 24644 KB Output is correct
91 Correct 393 ms 26324 KB Output is correct
92 Correct 393 ms 26532 KB Output is correct
93 Correct 369 ms 148132 KB Output is correct
94 Correct 366 ms 146468 KB Output is correct
95 Correct 363 ms 148032 KB Output is correct
96 Correct 374 ms 147620 KB Output is correct
97 Correct 363 ms 147860 KB Output is correct
98 Correct 407 ms 139940 KB Output is correct
99 Correct 366 ms 147788 KB Output is correct
100 Correct 355 ms 152232 KB Output is correct
101 Correct 522 ms 156712 KB Output is correct
102 Correct 374 ms 153812 KB Output is correct
103 Correct 388 ms 152728 KB Output is correct
104 Correct 364 ms 153508 KB Output is correct
105 Correct 453 ms 30884 KB Output is correct
106 Correct 360 ms 150376 KB Output is correct
107 Correct 360 ms 151148 KB Output is correct
108 Correct 369 ms 151196 KB Output is correct
109 Correct 366 ms 153088 KB Output is correct
110 Correct 370 ms 152968 KB Output is correct
111 Correct 364 ms 151108 KB Output is correct
112 Correct 367 ms 153188 KB Output is correct
113 Correct 358 ms 150936 KB Output is correct
114 Correct 357 ms 151720 KB Output is correct
115 Correct 370 ms 149724 KB Output is correct
116 Correct 359 ms 152664 KB Output is correct