oj.uz

답안 #856042

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
856042 2023-10-02T15:33:42 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 207960 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> v;
	for (int i = 1; i <= N; i++) {
		rf(Y[i]); rf(X[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:143:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  143 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:143:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  143 |  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 6588 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 6492 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 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 4 ms 8392 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 5 ms 8404 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 5 ms 8792 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 276 ms 126392 KB Output is correct
2 Correct 274 ms 125704 KB Output is correct
3 Correct 271 ms 126908 KB Output is correct
4 Correct 264 ms 125300 KB Output is correct
5 Correct 293 ms 18616 KB Output is correct
6 Correct 875 ms 47992 KB Output is correct
7 Correct 426 ms 22644 KB Output is correct
8 Correct 494 ms 26120 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 242 ms 60276 KB Output is correct
3 Correct 905 ms 192412 KB Output is correct
4 Correct 898 ms 192876 KB Output is correct
5 Correct 1155 ms 190952 KB Output is correct
6 Correct 382 ms 89792 KB Output is correct
7 Correct 123 ms 46676 KB Output is correct
8 Correct 16 ms 15064 KB Output is correct
9 Correct 950 ms 193240 KB Output is correct
10 Correct 1314 ms 182456 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 570 ms 176620 KB Output is correct
2 Correct 299 ms 147124 KB Output is correct
3 Correct 717 ms 135552 KB Output is correct
4 Correct 332 ms 151116 KB Output is correct
5 Correct 383 ms 155068 KB Output is correct
6 Correct 467 ms 128340 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 6588 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 6492 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 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 4 ms 8392 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 5 ms 8404 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 5 ms 8792 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 8 ms 10332 KB Output is correct
28 Correct 8 ms 10448 KB Output is correct
29 Correct 8 ms 10332 KB Output is correct
30 Correct 9 ms 10844 KB Output is correct
31 Correct 10 ms 11272 KB Output is correct
32 Correct 9 ms 11096 KB Output is correct
33 Correct 92 ms 38052 KB Output is correct
34 Correct 90 ms 37956 KB Output is correct
35 Correct 98 ms 37828 KB Output is correct
36 Correct 157 ms 53032 KB Output is correct
37 Correct 125 ms 48820 KB Output is correct
38 Correct 167 ms 54468 KB Output is correct
39 Correct 108 ms 12484 KB Output is correct
40 Correct 106 ms 12484 KB Output is correct
41 Correct 108 ms 12520 KB Output is correct
42 Correct 112 ms 13484 KB Output is correct
43 Correct 89 ms 44416 KB Output is correct
44 Correct 91 ms 44740 KB Output is correct
45 Correct 99 ms 44920 KB Output is correct
46 Correct 89 ms 43648 KB Output is correct
47 Correct 88 ms 43436 KB Output is correct
48 Correct 91 ms 44740 KB Output is correct
49 Correct 88 ms 43720 KB Output is correct
50 Correct 92 ms 45508 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6588 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 6492 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 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 4 ms 8392 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 5 ms 8404 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 5 ms 8792 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 276 ms 126392 KB Output is correct
28 Correct 274 ms 125704 KB Output is correct
29 Correct 271 ms 126908 KB Output is correct
30 Correct 264 ms 125300 KB Output is correct
31 Correct 293 ms 18616 KB Output is correct
32 Correct 875 ms 47992 KB Output is correct
33 Correct 426 ms 22644 KB Output is correct
34 Correct 494 ms 26120 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 242 ms 60276 KB Output is correct
37 Correct 905 ms 192412 KB Output is correct
38 Correct 898 ms 192876 KB Output is correct
39 Correct 1155 ms 190952 KB Output is correct
40 Correct 382 ms 89792 KB Output is correct
41 Correct 123 ms 46676 KB Output is correct
42 Correct 16 ms 15064 KB Output is correct
43 Correct 950 ms 193240 KB Output is correct
44 Correct 1314 ms 182456 KB Output is correct
45 Correct 570 ms 176620 KB Output is correct
46 Correct 299 ms 147124 KB Output is correct
47 Correct 717 ms 135552 KB Output is correct
48 Correct 332 ms 151116 KB Output is correct
49 Correct 383 ms 155068 KB Output is correct
50 Correct 467 ms 128340 KB Output is correct
51 Correct 8 ms 10332 KB Output is correct
52 Correct 8 ms 10448 KB Output is correct
53 Correct 8 ms 10332 KB Output is correct
54 Correct 9 ms 10844 KB Output is correct
55 Correct 10 ms 11272 KB Output is correct
56 Correct 9 ms 11096 KB Output is correct
57 Correct 92 ms 38052 KB Output is correct
58 Correct 90 ms 37956 KB Output is correct
59 Correct 98 ms 37828 KB Output is correct
60 Correct 157 ms 53032 KB Output is correct
61 Correct 125 ms 48820 KB Output is correct
62 Correct 167 ms 54468 KB Output is correct
63 Correct 108 ms 12484 KB Output is correct
64 Correct 106 ms 12484 KB Output is correct
65 Correct 108 ms 12520 KB Output is correct
66 Correct 112 ms 13484 KB Output is correct
67 Correct 89 ms 44416 KB Output is correct
68 Correct 91 ms 44740 KB Output is correct
69 Correct 99 ms 44920 KB Output is correct
70 Correct 89 ms 43648 KB Output is correct
71 Correct 88 ms 43436 KB Output is correct
72 Correct 91 ms 44740 KB Output is correct
73 Correct 88 ms 43720 KB Output is correct
74 Correct 92 ms 45508 KB Output is correct
75 Correct 375 ms 128968 KB Output is correct
76 Correct 301 ms 127384 KB Output is correct
77 Correct 351 ms 128136 KB Output is correct
78 Correct 361 ms 128180 KB Output is correct
79 Correct 431 ms 127564 KB Output is correct
80 Correct 340 ms 126900 KB Output is correct
81 Correct 742 ms 182008 KB Output is correct
82 Correct 1245 ms 207960 KB Output is correct
83 Correct 886 ms 191440 KB Output is correct
84 Correct 1229 ms 207496 KB Output is correct
85 Correct 741 ms 181896 KB Output is correct
86 Correct 1069 ms 200048 KB Output is correct
87 Correct 850 ms 189468 KB Output is correct
88 Correct 360 ms 26740 KB Output is correct
89 Correct 360 ms 26036 KB Output is correct
90 Correct 360 ms 26156 KB Output is correct
91 Correct 355 ms 25528 KB Output is correct
92 Correct 358 ms 25640 KB Output is correct
93 Correct 2356 ms 79028 KB Output is correct
94 Correct 344 ms 146824 KB Output is correct
95 Correct 2196 ms 77776 KB Output is correct
96 Correct 2730 ms 86012 KB Output is correct
97 Correct 328 ms 147276 KB Output is correct
98 Correct 1804 ms 51832 KB Output is correct
99 Execution timed out 3071 ms 94164 KB Time limit exceeded
100 Halted 0 ms 0 KB -