oj.uz

답안 #855481

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
855481 2023-10-01T10:08:42 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 247496 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 {
	int n, base;
	vector<set<pii>> 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, int li) {
		auto it = T[idx].lower_bound({y, 0});
		auto tmp = it;
		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;
		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++].insert(x);
			if (~q & 1) T[q--].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, li);
			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:125:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  125 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:125:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  125 |  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 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 6568 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6644 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 4 ms 8520 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 5 ms 8540 KB Output is correct
22 Correct 5 ms 9032 KB Output is correct
23 Correct 9 ms 9820 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 5 ms 8792 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 376 ms 126172 KB Output is correct
2 Correct 377 ms 126556 KB Output is correct
3 Correct 384 ms 126296 KB Output is correct
4 Correct 363 ms 125464 KB Output is correct
5 Correct 296 ms 71932 KB Output is correct
6 Correct 398 ms 135620 KB Output is correct
7 Correct 368 ms 126872 KB Output is correct
8 Correct 347 ms 128516 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 274 ms 59732 KB Output is correct
3 Correct 929 ms 193400 KB Output is correct
4 Correct 919 ms 191352 KB Output is correct
5 Correct 1211 ms 189500 KB Output is correct
6 Correct 393 ms 89536 KB Output is correct
7 Correct 134 ms 46280 KB Output is correct
8 Correct 16 ms 15064 KB Output is correct
9 Correct 1067 ms 195860 KB Output is correct
10 Correct 1560 ms 185996 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 699 ms 183900 KB Output is correct
2 Correct 310 ms 147344 KB Output is correct
3 Correct 668 ms 134940 KB Output is correct
4 Correct 346 ms 151480 KB Output is correct
5 Correct 333 ms 149556 KB Output is correct
6 Correct 618 ms 129140 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 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 6568 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6644 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 4 ms 8520 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 5 ms 8540 KB Output is correct
22 Correct 5 ms 9032 KB Output is correct
23 Correct 9 ms 9820 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 5 ms 8792 KB Output is correct
27 Correct 9 ms 10332 KB Output is correct
28 Correct 9 ms 10328 KB Output is correct
29 Correct 8 ms 10332 KB Output is correct
30 Correct 13 ms 12184 KB Output is correct
31 Correct 10 ms 11356 KB Output is correct
32 Correct 10 ms 11212 KB Output is correct
33 Correct 91 ms 37828 KB Output is correct
34 Correct 110 ms 37964 KB Output is correct
35 Correct 102 ms 37576 KB Output is correct
36 Correct 156 ms 50060 KB Output is correct
37 Correct 140 ms 50632 KB Output is correct
38 Correct 164 ms 52964 KB Output is correct
39 Correct 116 ms 12484 KB Output is correct
40 Correct 127 ms 12448 KB Output is correct
41 Correct 112 ms 12488 KB Output is correct
42 Correct 119 ms 13252 KB Output is correct
43 Correct 94 ms 44336 KB Output is correct
44 Correct 91 ms 43716 KB Output is correct
45 Correct 92 ms 44228 KB Output is correct
46 Correct 95 ms 44112 KB Output is correct
47 Correct 108 ms 43200 KB Output is correct
48 Correct 99 ms 44108 KB Output is correct
49 Correct 89 ms 42956 KB Output is correct
50 Correct 94 ms 43852 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 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 6568 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6644 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 4 ms 8520 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 5 ms 8540 KB Output is correct
22 Correct 5 ms 9032 KB Output is correct
23 Correct 9 ms 9820 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 5 ms 8792 KB Output is correct
27 Correct 376 ms 126172 KB Output is correct
28 Correct 377 ms 126556 KB Output is correct
29 Correct 384 ms 126296 KB Output is correct
30 Correct 363 ms 125464 KB Output is correct
31 Correct 296 ms 71932 KB Output is correct
32 Correct 398 ms 135620 KB Output is correct
33 Correct 368 ms 126872 KB Output is correct
34 Correct 347 ms 128516 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 274 ms 59732 KB Output is correct
37 Correct 929 ms 193400 KB Output is correct
38 Correct 919 ms 191352 KB Output is correct
39 Correct 1211 ms 189500 KB Output is correct
40 Correct 393 ms 89536 KB Output is correct
41 Correct 134 ms 46280 KB Output is correct
42 Correct 16 ms 15064 KB Output is correct
43 Correct 1067 ms 195860 KB Output is correct
44 Correct 1560 ms 185996 KB Output is correct
45 Correct 699 ms 183900 KB Output is correct
46 Correct 310 ms 147344 KB Output is correct
47 Correct 668 ms 134940 KB Output is correct
48 Correct 346 ms 151480 KB Output is correct
49 Correct 333 ms 149556 KB Output is correct
50 Correct 618 ms 129140 KB Output is correct
51 Correct 9 ms 10332 KB Output is correct
52 Correct 9 ms 10328 KB Output is correct
53 Correct 8 ms 10332 KB Output is correct
54 Correct 13 ms 12184 KB Output is correct
55 Correct 10 ms 11356 KB Output is correct
56 Correct 10 ms 11212 KB Output is correct
57 Correct 91 ms 37828 KB Output is correct
58 Correct 110 ms 37964 KB Output is correct
59 Correct 102 ms 37576 KB Output is correct
60 Correct 156 ms 50060 KB Output is correct
61 Correct 140 ms 50632 KB Output is correct
62 Correct 164 ms 52964 KB Output is correct
63 Correct 116 ms 12484 KB Output is correct
64 Correct 127 ms 12448 KB Output is correct
65 Correct 112 ms 12488 KB Output is correct
66 Correct 119 ms 13252 KB Output is correct
67 Correct 94 ms 44336 KB Output is correct
68 Correct 91 ms 43716 KB Output is correct
69 Correct 92 ms 44228 KB Output is correct
70 Correct 95 ms 44112 KB Output is correct
71 Correct 108 ms 43200 KB Output is correct
72 Correct 99 ms 44108 KB Output is correct
73 Correct 89 ms 42956 KB Output is correct
74 Correct 94 ms 43852 KB Output is correct
75 Correct 398 ms 129216 KB Output is correct
76 Correct 381 ms 130264 KB Output is correct
77 Correct 344 ms 130496 KB Output is correct
78 Correct 377 ms 128428 KB Output is correct
79 Correct 464 ms 130232 KB Output is correct
80 Correct 357 ms 128472 KB Output is correct
81 Correct 860 ms 188568 KB Output is correct
82 Correct 720 ms 179396 KB Output is correct
83 Correct 741 ms 180388 KB Output is correct
84 Correct 1192 ms 204040 KB Output is correct
85 Correct 817 ms 185416 KB Output is correct
86 Correct 743 ms 179068 KB Output is correct
87 Correct 2825 ms 247496 KB Output is correct
88 Correct 450 ms 27020 KB Output is correct
89 Correct 445 ms 26032 KB Output is correct
90 Correct 466 ms 26576 KB Output is correct
91 Correct 430 ms 26556 KB Output is correct
92 Correct 440 ms 25680 KB Output is correct
93 Correct 359 ms 148088 KB Output is correct
94 Execution timed out 3015 ms 97656 KB Time limit exceeded
95 Halted 0 ms 0 KB -