oj.uz

답안 #855939

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

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

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

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 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 6536 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 6592 KB Output is correct
16 Correct 2 ms 6748 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 5 ms 9304 KB Output is correct
21 Correct 5 ms 9308 KB Output is correct
22 Correct 6 ms 10112 KB Output is correct
23 Correct 13 ms 11208 KB Output is correct
24 Correct 6 ms 9816 KB Output is correct
25 Correct 5 ms 9564 KB Output is correct
26 Correct 7 ms 9820 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 383 ms 173876 KB Output is correct
2 Correct 387 ms 173636 KB Output is correct
3 Correct 383 ms 172220 KB Output is correct
4 Correct 376 ms 173976 KB Output is correct
5 Correct 333 ms 96432 KB Output is correct
6 Correct 400 ms 190392 KB Output is correct
7 Correct 377 ms 177092 KB Output is correct
8 Correct 384 ms 181128 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 286 ms 80892 KB Output is correct
3 Correct 1034 ms 268168 KB Output is correct
4 Correct 1004 ms 267624 KB Output is correct
5 Correct 1208 ms 263180 KB Output is correct
6 Correct 426 ms 122780 KB Output is correct
7 Correct 160 ms 62768 KB Output is correct
8 Correct 17 ms 18892 KB Output is correct
9 Correct 1130 ms 272300 KB Output is correct
10 Correct 1542 ms 254228 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 775 ms 257532 KB Output is correct
2 Correct 359 ms 209232 KB Output is correct
3 Correct 593 ms 183992 KB Output is correct
4 Correct 414 ms 214208 KB Output is correct
5 Correct 384 ms 211104 KB Output is correct
6 Correct 532 ms 176488 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 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 6536 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 6592 KB Output is correct
16 Correct 2 ms 6748 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 5 ms 9304 KB Output is correct
21 Correct 5 ms 9308 KB Output is correct
22 Correct 6 ms 10112 KB Output is correct
23 Correct 13 ms 11208 KB Output is correct
24 Correct 6 ms 9816 KB Output is correct
25 Correct 5 ms 9564 KB Output is correct
26 Correct 7 ms 9820 KB Output is correct
27 Correct 9 ms 11980 KB Output is correct
28 Correct 9 ms 12088 KB Output is correct
29 Correct 9 ms 12040 KB Output is correct
30 Correct 14 ms 14428 KB Output is correct
31 Correct 10 ms 13516 KB Output is correct
32 Correct 11 ms 13404 KB Output is correct
33 Correct 97 ms 49096 KB Output is correct
34 Correct 107 ms 49092 KB Output is correct
35 Correct 115 ms 49272 KB Output is correct
36 Correct 180 ms 68548 KB Output is correct
37 Correct 171 ms 69316 KB Output is correct
38 Correct 199 ms 72396 KB Output is correct
39 Correct 115 ms 12532 KB Output is correct
40 Correct 114 ms 12668 KB Output is correct
41 Correct 112 ms 12632 KB Output is correct
42 Correct 118 ms 13656 KB Output is correct
43 Correct 117 ms 60360 KB Output is correct
44 Correct 108 ms 59424 KB Output is correct
45 Correct 114 ms 60360 KB Output is correct
46 Correct 111 ms 60100 KB Output is correct
47 Correct 107 ms 58808 KB Output is correct
48 Correct 109 ms 60096 KB Output is correct
49 Correct 107 ms 58380 KB Output is correct
50 Correct 107 ms 59456 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 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 6536 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 6592 KB Output is correct
16 Correct 2 ms 6748 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 5 ms 9304 KB Output is correct
21 Correct 5 ms 9308 KB Output is correct
22 Correct 6 ms 10112 KB Output is correct
23 Correct 13 ms 11208 KB Output is correct
24 Correct 6 ms 9816 KB Output is correct
25 Correct 5 ms 9564 KB Output is correct
26 Correct 7 ms 9820 KB Output is correct
27 Correct 383 ms 173876 KB Output is correct
28 Correct 387 ms 173636 KB Output is correct
29 Correct 383 ms 172220 KB Output is correct
30 Correct 376 ms 173976 KB Output is correct
31 Correct 333 ms 96432 KB Output is correct
32 Correct 400 ms 190392 KB Output is correct
33 Correct 377 ms 177092 KB Output is correct
34 Correct 384 ms 181128 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 286 ms 80892 KB Output is correct
37 Correct 1034 ms 268168 KB Output is correct
38 Correct 1004 ms 267624 KB Output is correct
39 Correct 1208 ms 263180 KB Output is correct
40 Correct 426 ms 122780 KB Output is correct
41 Correct 160 ms 62768 KB Output is correct
42 Correct 17 ms 18892 KB Output is correct
43 Correct 1130 ms 272300 KB Output is correct
44 Correct 1542 ms 254228 KB Output is correct
45 Correct 775 ms 257532 KB Output is correct
46 Correct 359 ms 209232 KB Output is correct
47 Correct 593 ms 183992 KB Output is correct
48 Correct 414 ms 214208 KB Output is correct
49 Correct 384 ms 211104 KB Output is correct
50 Correct 532 ms 176488 KB Output is correct
51 Correct 9 ms 11980 KB Output is correct
52 Correct 9 ms 12088 KB Output is correct
53 Correct 9 ms 12040 KB Output is correct
54 Correct 14 ms 14428 KB Output is correct
55 Correct 10 ms 13516 KB Output is correct
56 Correct 11 ms 13404 KB Output is correct
57 Correct 97 ms 49096 KB Output is correct
58 Correct 107 ms 49092 KB Output is correct
59 Correct 115 ms 49272 KB Output is correct
60 Correct 180 ms 68548 KB Output is correct
61 Correct 171 ms 69316 KB Output is correct
62 Correct 199 ms 72396 KB Output is correct
63 Correct 115 ms 12532 KB Output is correct
64 Correct 114 ms 12668 KB Output is correct
65 Correct 112 ms 12632 KB Output is correct
66 Correct 118 ms 13656 KB Output is correct
67 Correct 117 ms 60360 KB Output is correct
68 Correct 108 ms 59424 KB Output is correct
69 Correct 114 ms 60360 KB Output is correct
70 Correct 111 ms 60100 KB Output is correct
71 Correct 107 ms 58808 KB Output is correct
72 Correct 109 ms 60096 KB Output is correct
73 Correct 107 ms 58380 KB Output is correct
74 Correct 107 ms 59456 KB Output is correct
75 Correct 401 ms 174520 KB Output is correct
76 Correct 382 ms 174516 KB Output is correct
77 Correct 363 ms 174104 KB Output is correct
78 Correct 383 ms 175060 KB Output is correct
79 Correct 450 ms 174884 KB Output is correct
80 Correct 370 ms 173496 KB Output is correct
81 Correct 947 ms 258492 KB Output is correct
82 Correct 776 ms 245428 KB Output is correct
83 Correct 781 ms 245940 KB Output is correct
84 Correct 1235 ms 276276 KB Output is correct
85 Correct 880 ms 254372 KB Output is correct
86 Correct 758 ms 244152 KB Output is correct
87 Correct 2756 ms 325700 KB Output is correct
88 Correct 388 ms 22928 KB Output is correct
89 Correct 378 ms 23736 KB Output is correct
90 Correct 377 ms 22644 KB Output is correct
91 Correct 391 ms 22992 KB Output is correct
92 Correct 389 ms 23480 KB Output is correct
93 Correct 405 ms 205752 KB Output is correct
94 Correct 2786 ms 91348 KB Output is correct
95 Correct 410 ms 204952 KB Output is correct
96 Correct 417 ms 205748 KB Output is correct
97 Correct 2012 ms 67256 KB Output is correct
98 Correct 433 ms 191156 KB Output is correct
99 Correct 406 ms 204328 KB Output is correct
100 Correct 388 ms 204896 KB Output is correct
101 Correct 582 ms 207724 KB Output is correct
102 Correct 418 ms 204724 KB Output is correct
103 Execution timed out 3058 ms 86408 KB Time limit exceeded
104 Halted 0 ms 0 KB -