oj.uz

답안 #855938

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

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

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

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 6488 KB Output is correct
2 Correct 1 ms 6492 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 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 6492 KB Output is correct
16 Correct 2 ms 6856 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 9308 KB Output is correct
20 Correct 4 ms 9308 KB Output is correct
21 Correct 5 ms 9308 KB Output is correct
22 Correct 6 ms 9932 KB Output is correct
23 Correct 10 ms 10844 KB Output is correct
24 Correct 6 ms 9836 KB Output is correct
25 Correct 5 ms 9564 KB Output is correct
26 Correct 6 ms 9820 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 385 ms 176064 KB Output is correct
2 Correct 399 ms 176820 KB Output is correct
3 Correct 408 ms 176872 KB Output is correct
4 Correct 383 ms 176052 KB Output is correct
5 Correct 321 ms 98436 KB Output is correct
6 Correct 417 ms 191820 KB Output is correct
7 Correct 380 ms 178872 KB Output is correct
8 Correct 409 ms 183496 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 291 ms 81948 KB Output is correct
3 Correct 1053 ms 271556 KB Output is correct
4 Correct 1048 ms 270688 KB Output is correct
5 Correct 1259 ms 265964 KB Output is correct
6 Correct 443 ms 124868 KB Output is correct
7 Correct 153 ms 63376 KB Output is correct
8 Correct 19 ms 18904 KB Output is correct
9 Correct 1140 ms 273956 KB Output is correct
10 Correct 1612 ms 258484 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 769 ms 260536 KB Output is correct
2 Correct 373 ms 211324 KB Output is correct
3 Correct 715 ms 189464 KB Output is correct
4 Correct 431 ms 216828 KB Output is correct
5 Correct 398 ms 214792 KB Output is correct
6 Correct 565 ms 180720 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 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 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 6492 KB Output is correct
16 Correct 2 ms 6856 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 9308 KB Output is correct
20 Correct 4 ms 9308 KB Output is correct
21 Correct 5 ms 9308 KB Output is correct
22 Correct 6 ms 9932 KB Output is correct
23 Correct 10 ms 10844 KB Output is correct
24 Correct 6 ms 9836 KB Output is correct
25 Correct 5 ms 9564 KB Output is correct
26 Correct 6 ms 9820 KB Output is correct
27 Correct 8 ms 11868 KB Output is correct
28 Correct 9 ms 11868 KB Output is correct
29 Correct 9 ms 11868 KB Output is correct
30 Correct 15 ms 14504 KB Output is correct
31 Correct 13 ms 13380 KB Output is correct
32 Correct 11 ms 13400 KB Output is correct
33 Correct 99 ms 50632 KB Output is correct
34 Correct 109 ms 50540 KB Output is correct
35 Correct 113 ms 50384 KB Output is correct
36 Correct 174 ms 69572 KB Output is correct
37 Correct 181 ms 70288 KB Output is correct
38 Correct 198 ms 73156 KB Output is correct
39 Correct 109 ms 13016 KB Output is correct
40 Correct 109 ms 12956 KB Output is correct
41 Correct 109 ms 12996 KB Output is correct
42 Correct 121 ms 14272 KB Output is correct
43 Correct 113 ms 61708 KB Output is correct
44 Correct 113 ms 60280 KB Output is correct
45 Correct 111 ms 61380 KB Output is correct
46 Correct 114 ms 61304 KB Output is correct
47 Correct 109 ms 59844 KB Output is correct
48 Correct 110 ms 61332 KB Output is correct
49 Correct 105 ms 59336 KB Output is correct
50 Correct 110 ms 60680 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 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 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 6492 KB Output is correct
16 Correct 2 ms 6856 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 9308 KB Output is correct
20 Correct 4 ms 9308 KB Output is correct
21 Correct 5 ms 9308 KB Output is correct
22 Correct 6 ms 9932 KB Output is correct
23 Correct 10 ms 10844 KB Output is correct
24 Correct 6 ms 9836 KB Output is correct
25 Correct 5 ms 9564 KB Output is correct
26 Correct 6 ms 9820 KB Output is correct
27 Correct 385 ms 176064 KB Output is correct
28 Correct 399 ms 176820 KB Output is correct
29 Correct 408 ms 176872 KB Output is correct
30 Correct 383 ms 176052 KB Output is correct
31 Correct 321 ms 98436 KB Output is correct
32 Correct 417 ms 191820 KB Output is correct
33 Correct 380 ms 178872 KB Output is correct
34 Correct 409 ms 183496 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 291 ms 81948 KB Output is correct
37 Correct 1053 ms 271556 KB Output is correct
38 Correct 1048 ms 270688 KB Output is correct
39 Correct 1259 ms 265964 KB Output is correct
40 Correct 443 ms 124868 KB Output is correct
41 Correct 153 ms 63376 KB Output is correct
42 Correct 19 ms 18904 KB Output is correct
43 Correct 1140 ms 273956 KB Output is correct
44 Correct 1612 ms 258484 KB Output is correct
45 Correct 769 ms 260536 KB Output is correct
46 Correct 373 ms 211324 KB Output is correct
47 Correct 715 ms 189464 KB Output is correct
48 Correct 431 ms 216828 KB Output is correct
49 Correct 398 ms 214792 KB Output is correct
50 Correct 565 ms 180720 KB Output is correct
51 Correct 8 ms 11868 KB Output is correct
52 Correct 9 ms 11868 KB Output is correct
53 Correct 9 ms 11868 KB Output is correct
54 Correct 15 ms 14504 KB Output is correct
55 Correct 13 ms 13380 KB Output is correct
56 Correct 11 ms 13400 KB Output is correct
57 Correct 99 ms 50632 KB Output is correct
58 Correct 109 ms 50540 KB Output is correct
59 Correct 113 ms 50384 KB Output is correct
60 Correct 174 ms 69572 KB Output is correct
61 Correct 181 ms 70288 KB Output is correct
62 Correct 198 ms 73156 KB Output is correct
63 Correct 109 ms 13016 KB Output is correct
64 Correct 109 ms 12956 KB Output is correct
65 Correct 109 ms 12996 KB Output is correct
66 Correct 121 ms 14272 KB Output is correct
67 Correct 113 ms 61708 KB Output is correct
68 Correct 113 ms 60280 KB Output is correct
69 Correct 111 ms 61380 KB Output is correct
70 Correct 114 ms 61304 KB Output is correct
71 Correct 109 ms 59844 KB Output is correct
72 Correct 110 ms 61332 KB Output is correct
73 Correct 105 ms 59336 KB Output is correct
74 Correct 110 ms 60680 KB Output is correct
75 Correct 396 ms 177936 KB Output is correct
76 Correct 396 ms 177556 KB Output is correct
77 Correct 370 ms 178356 KB Output is correct
78 Correct 377 ms 177460 KB Output is correct
79 Correct 456 ms 179136 KB Output is correct
80 Correct 386 ms 179124 KB Output is correct
81 Correct 940 ms 265924 KB Output is correct
82 Correct 816 ms 253624 KB Output is correct
83 Correct 844 ms 254124 KB Output is correct
84 Correct 1267 ms 285008 KB Output is correct
85 Correct 885 ms 262188 KB Output is correct
86 Correct 760 ms 251748 KB Output is correct
87 Correct 2770 ms 334076 KB Output is correct
88 Correct 387 ms 27164 KB Output is correct
89 Correct 390 ms 26260 KB Output is correct
90 Correct 393 ms 26480 KB Output is correct
91 Correct 383 ms 27144 KB Output is correct
92 Correct 381 ms 27320 KB Output is correct
93 Correct 408 ms 212100 KB Output is correct
94 Correct 2783 ms 97488 KB Output is correct
95 Correct 416 ms 211660 KB Output is correct
96 Correct 428 ms 211888 KB Output is correct
97 Correct 2093 ms 74304 KB Output is correct
98 Correct 432 ms 197760 KB Output is correct
99 Correct 415 ms 211856 KB Output is correct
100 Correct 383 ms 211608 KB Output is correct
101 Correct 549 ms 214552 KB Output is correct
102 Correct 419 ms 211664 KB Output is correct
103 Execution timed out 3039 ms 94940 KB Time limit exceeded
104 Halted 0 ms 0 KB -