oj.uz

답안 #855941

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
855941 2023-10-02T11:01:57 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 320388 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>

using namespace std;
typedef pair<int, int> pii;

// const int K = 2;
const int LIM = 5;

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 {
		vector<pii> v;
		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) {
		if (T[idx].s.size() > LIM) {
			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);
				}
			}
			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);
				}
			}
		} else {
			for (pii i : T[idx].v) chk(i.second);
		}
	}

	void upd(int p, int q, pii x) {
		p += base; q += base;
		p--; q--;
		while (p <= q) {
			if (p & 1) {
				if (T[p].v.size() < LIM) T[p].v.push_back(x);
				T[p++].s.insert(x);
			}
			if (~q & 1) {
				if (T[q].v.size() < LIM) T[q].v.push_back(x);
				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:141:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  141 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:141:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  141 |  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 6488 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 6504 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 9048 KB Output is correct
20 Correct 4 ms 9052 KB Output is correct
21 Correct 5 ms 9052 KB Output is correct
22 Correct 6 ms 9820 KB Output is correct
23 Correct 10 ms 10844 KB Output is correct
24 Correct 6 ms 9820 KB Output is correct
25 Correct 5 ms 9564 KB Output is correct
26 Correct 6 ms 9844 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 380 ms 170068 KB Output is correct
2 Correct 380 ms 170340 KB Output is correct
3 Correct 402 ms 170428 KB Output is correct
4 Correct 369 ms 169400 KB Output is correct
5 Correct 316 ms 94184 KB Output is correct
6 Correct 400 ms 187060 KB Output is correct
7 Correct 386 ms 174480 KB Output is correct
8 Correct 383 ms 178100 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 311 ms 79304 KB Output is correct
3 Correct 1060 ms 264472 KB Output is correct
4 Correct 1055 ms 263252 KB Output is correct
5 Correct 1303 ms 256224 KB Output is correct
6 Correct 452 ms 120196 KB Output is correct
7 Correct 169 ms 61112 KB Output is correct
8 Correct 17 ms 18392 KB Output is correct
9 Correct 1173 ms 266496 KB Output is correct
10 Correct 1600 ms 247896 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 758 ms 252284 KB Output is correct
2 Correct 367 ms 204728 KB Output is correct
3 Correct 675 ms 180668 KB Output is correct
4 Correct 412 ms 210912 KB Output is correct
5 Correct 385 ms 207288 KB Output is correct
6 Correct 565 ms 171208 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 6488 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 6504 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 9048 KB Output is correct
20 Correct 4 ms 9052 KB Output is correct
21 Correct 5 ms 9052 KB Output is correct
22 Correct 6 ms 9820 KB Output is correct
23 Correct 10 ms 10844 KB Output is correct
24 Correct 6 ms 9820 KB Output is correct
25 Correct 5 ms 9564 KB Output is correct
26 Correct 6 ms 9844 KB Output is correct
27 Correct 8 ms 11608 KB Output is correct
28 Correct 8 ms 11612 KB Output is correct
29 Correct 8 ms 11612 KB Output is correct
30 Correct 14 ms 14172 KB Output is correct
31 Correct 11 ms 13108 KB Output is correct
32 Correct 11 ms 13148 KB Output is correct
33 Correct 96 ms 47464 KB Output is correct
34 Correct 105 ms 47296 KB Output is correct
35 Correct 109 ms 47556 KB Output is correct
36 Correct 180 ms 67264 KB Output is correct
37 Correct 180 ms 67688 KB Output is correct
38 Correct 196 ms 70476 KB Output is correct
39 Correct 117 ms 11536 KB Output is correct
40 Correct 107 ms 11624 KB Output is correct
41 Correct 110 ms 11712 KB Output is correct
42 Correct 114 ms 12196 KB Output is correct
43 Correct 117 ms 58976 KB Output is correct
44 Correct 108 ms 57796 KB Output is correct
45 Correct 111 ms 58700 KB Output is correct
46 Correct 111 ms 58564 KB Output is correct
47 Correct 106 ms 57280 KB Output is correct
48 Correct 111 ms 58672 KB Output is correct
49 Correct 105 ms 56772 KB Output is correct
50 Correct 109 ms 58016 KB Output is correct

Subtask #6
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 6488 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 6504 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 9048 KB Output is correct
20 Correct 4 ms 9052 KB Output is correct
21 Correct 5 ms 9052 KB Output is correct
22 Correct 6 ms 9820 KB Output is correct
23 Correct 10 ms 10844 KB Output is correct
24 Correct 6 ms 9820 KB Output is correct
25 Correct 5 ms 9564 KB Output is correct
26 Correct 6 ms 9844 KB Output is correct
27 Correct 380 ms 170068 KB Output is correct
28 Correct 380 ms 170340 KB Output is correct
29 Correct 402 ms 170428 KB Output is correct
30 Correct 369 ms 169400 KB Output is correct
31 Correct 316 ms 94184 KB Output is correct
32 Correct 400 ms 187060 KB Output is correct
33 Correct 386 ms 174480 KB Output is correct
34 Correct 383 ms 178100 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 311 ms 79304 KB Output is correct
37 Correct 1060 ms 264472 KB Output is correct
38 Correct 1055 ms 263252 KB Output is correct
39 Correct 1303 ms 256224 KB Output is correct
40 Correct 452 ms 120196 KB Output is correct
41 Correct 169 ms 61112 KB Output is correct
42 Correct 17 ms 18392 KB Output is correct
43 Correct 1173 ms 266496 KB Output is correct
44 Correct 1600 ms 247896 KB Output is correct
45 Correct 758 ms 252284 KB Output is correct
46 Correct 367 ms 204728 KB Output is correct
47 Correct 675 ms 180668 KB Output is correct
48 Correct 412 ms 210912 KB Output is correct
49 Correct 385 ms 207288 KB Output is correct
50 Correct 565 ms 171208 KB Output is correct
51 Correct 8 ms 11608 KB Output is correct
52 Correct 8 ms 11612 KB Output is correct
53 Correct 8 ms 11612 KB Output is correct
54 Correct 14 ms 14172 KB Output is correct
55 Correct 11 ms 13108 KB Output is correct
56 Correct 11 ms 13148 KB Output is correct
57 Correct 96 ms 47464 KB Output is correct
58 Correct 105 ms 47296 KB Output is correct
59 Correct 109 ms 47556 KB Output is correct
60 Correct 180 ms 67264 KB Output is correct
61 Correct 180 ms 67688 KB Output is correct
62 Correct 196 ms 70476 KB Output is correct
63 Correct 117 ms 11536 KB Output is correct
64 Correct 107 ms 11624 KB Output is correct
65 Correct 110 ms 11712 KB Output is correct
66 Correct 114 ms 12196 KB Output is correct
67 Correct 117 ms 58976 KB Output is correct
68 Correct 108 ms 57796 KB Output is correct
69 Correct 111 ms 58700 KB Output is correct
70 Correct 111 ms 58564 KB Output is correct
71 Correct 106 ms 57280 KB Output is correct
72 Correct 111 ms 58672 KB Output is correct
73 Correct 105 ms 56772 KB Output is correct
74 Correct 109 ms 58016 KB Output is correct
75 Correct 395 ms 169408 KB Output is correct
76 Correct 399 ms 170460 KB Output is correct
77 Correct 363 ms 169076 KB Output is correct
78 Correct 381 ms 170512 KB Output is correct
79 Correct 451 ms 170812 KB Output is correct
80 Correct 381 ms 169528 KB Output is correct
81 Correct 930 ms 257972 KB Output is correct
82 Correct 780 ms 245944 KB Output is correct
83 Correct 791 ms 246784 KB Output is correct
84 Correct 1293 ms 275848 KB Output is correct
85 Correct 877 ms 253376 KB Output is correct
86 Correct 777 ms 243128 KB Output is correct
87 Correct 2725 ms 320388 KB Output is correct
88 Correct 378 ms 22136 KB Output is correct
89 Correct 373 ms 23468 KB Output is correct
90 Correct 366 ms 22452 KB Output is correct
91 Correct 381 ms 22292 KB Output is correct
92 Correct 376 ms 23856 KB Output is correct
93 Correct 417 ms 204936 KB Output is correct
94 Correct 2725 ms 91404 KB Output is correct
95 Correct 404 ms 206176 KB Output is correct
96 Correct 420 ms 206300 KB Output is correct
97 Correct 2060 ms 65972 KB Output is correct
98 Correct 427 ms 191488 KB Output is correct
99 Correct 411 ms 204172 KB Output is correct
100 Correct 380 ms 205000 KB Output is correct
101 Correct 554 ms 208312 KB Output is correct
102 Correct 416 ms 205752 KB Output is correct
103 Execution timed out 3066 ms 88712 KB Time limit exceeded
104 Halted 0 ms 0 KB -