oj.uz

답안 #855942

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

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

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

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 6584 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 6488 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 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 5 ms 9052 KB Output is correct
20 Correct 5 ms 9048 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 10588 KB Output is correct
24 Correct 6 ms 9816 KB Output is correct
25 Correct 7 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 393 ms 169832 KB Output is correct
2 Correct 383 ms 169356 KB Output is correct
3 Correct 417 ms 168884 KB Output is correct
4 Correct 369 ms 169228 KB Output is correct
5 Correct 318 ms 92852 KB Output is correct
6 Correct 415 ms 188404 KB Output is correct
7 Correct 366 ms 175032 KB Output is correct
8 Correct 395 ms 177880 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 284 ms 78680 KB Output is correct
3 Correct 1035 ms 262184 KB Output is correct
4 Correct 1043 ms 261044 KB Output is correct
5 Correct 1288 ms 255108 KB Output is correct
6 Correct 476 ms 119832 KB Output is correct
7 Correct 153 ms 61124 KB Output is correct
8 Correct 17 ms 18388 KB Output is correct
9 Correct 1182 ms 263968 KB Output is correct
10 Correct 1592 ms 245652 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 755 ms 252996 KB Output is correct
2 Correct 364 ms 204616 KB Output is correct
3 Correct 687 ms 179068 KB Output is correct
4 Correct 408 ms 209588 KB Output is correct
5 Correct 385 ms 206400 KB Output is correct
6 Correct 572 ms 172472 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 6584 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 6488 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 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 5 ms 9052 KB Output is correct
20 Correct 5 ms 9048 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 10588 KB Output is correct
24 Correct 6 ms 9816 KB Output is correct
25 Correct 7 ms 9564 KB Output is correct
26 Correct 6 ms 9820 KB Output is correct
27 Correct 9 ms 11608 KB Output is correct
28 Correct 8 ms 11708 KB Output is correct
29 Correct 8 ms 11612 KB Output is correct
30 Correct 14 ms 14336 KB Output is correct
31 Correct 11 ms 13224 KB Output is correct
32 Correct 12 ms 13144 KB Output is correct
33 Correct 98 ms 47536 KB Output is correct
34 Correct 109 ms 47452 KB Output is correct
35 Correct 111 ms 47440 KB Output is correct
36 Correct 167 ms 67008 KB Output is correct
37 Correct 172 ms 67796 KB Output is correct
38 Correct 191 ms 70596 KB Output is correct
39 Correct 107 ms 11720 KB Output is correct
40 Correct 107 ms 11708 KB Output is correct
41 Correct 111 ms 11596 KB Output is correct
42 Correct 115 ms 12032 KB Output is correct
43 Correct 112 ms 59060 KB Output is correct
44 Correct 109 ms 57796 KB Output is correct
45 Correct 115 ms 58864 KB Output is correct
46 Correct 110 ms 58616 KB Output is correct
47 Correct 108 ms 57284 KB Output is correct
48 Correct 110 ms 58564 KB Output is correct
49 Correct 107 ms 56772 KB Output is correct
50 Correct 109 ms 58052 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 6584 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 6488 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 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 5 ms 9052 KB Output is correct
20 Correct 5 ms 9048 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 10588 KB Output is correct
24 Correct 6 ms 9816 KB Output is correct
25 Correct 7 ms 9564 KB Output is correct
26 Correct 6 ms 9820 KB Output is correct
27 Correct 393 ms 169832 KB Output is correct
28 Correct 383 ms 169356 KB Output is correct
29 Correct 417 ms 168884 KB Output is correct
30 Correct 369 ms 169228 KB Output is correct
31 Correct 318 ms 92852 KB Output is correct
32 Correct 415 ms 188404 KB Output is correct
33 Correct 366 ms 175032 KB Output is correct
34 Correct 395 ms 177880 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 284 ms 78680 KB Output is correct
37 Correct 1035 ms 262184 KB Output is correct
38 Correct 1043 ms 261044 KB Output is correct
39 Correct 1288 ms 255108 KB Output is correct
40 Correct 476 ms 119832 KB Output is correct
41 Correct 153 ms 61124 KB Output is correct
42 Correct 17 ms 18388 KB Output is correct
43 Correct 1182 ms 263968 KB Output is correct
44 Correct 1592 ms 245652 KB Output is correct
45 Correct 755 ms 252996 KB Output is correct
46 Correct 364 ms 204616 KB Output is correct
47 Correct 687 ms 179068 KB Output is correct
48 Correct 408 ms 209588 KB Output is correct
49 Correct 385 ms 206400 KB Output is correct
50 Correct 572 ms 172472 KB Output is correct
51 Correct 9 ms 11608 KB Output is correct
52 Correct 8 ms 11708 KB Output is correct
53 Correct 8 ms 11612 KB Output is correct
54 Correct 14 ms 14336 KB Output is correct
55 Correct 11 ms 13224 KB Output is correct
56 Correct 12 ms 13144 KB Output is correct
57 Correct 98 ms 47536 KB Output is correct
58 Correct 109 ms 47452 KB Output is correct
59 Correct 111 ms 47440 KB Output is correct
60 Correct 167 ms 67008 KB Output is correct
61 Correct 172 ms 67796 KB Output is correct
62 Correct 191 ms 70596 KB Output is correct
63 Correct 107 ms 11720 KB Output is correct
64 Correct 107 ms 11708 KB Output is correct
65 Correct 111 ms 11596 KB Output is correct
66 Correct 115 ms 12032 KB Output is correct
67 Correct 112 ms 59060 KB Output is correct
68 Correct 109 ms 57796 KB Output is correct
69 Correct 115 ms 58864 KB Output is correct
70 Correct 110 ms 58616 KB Output is correct
71 Correct 108 ms 57284 KB Output is correct
72 Correct 110 ms 58564 KB Output is correct
73 Correct 107 ms 56772 KB Output is correct
74 Correct 109 ms 58052 KB Output is correct
75 Correct 398 ms 170168 KB Output is correct
76 Correct 382 ms 169080 KB Output is correct
77 Correct 358 ms 169252 KB Output is correct
78 Correct 368 ms 169144 KB Output is correct
79 Correct 477 ms 171256 KB Output is correct
80 Correct 369 ms 168892 KB Output is correct
81 Correct 949 ms 257532 KB Output is correct
82 Correct 789 ms 246452 KB Output is correct
83 Correct 794 ms 245688 KB Output is correct
84 Correct 1306 ms 273100 KB Output is correct
85 Correct 908 ms 253172 KB Output is correct
86 Correct 760 ms 243724 KB Output is correct
87 Correct 2775 ms 316212 KB Output is correct
88 Correct 368 ms 22116 KB Output is correct
89 Correct 371 ms 23112 KB Output is correct
90 Correct 388 ms 23796 KB Output is correct
91 Correct 374 ms 22100 KB Output is correct
92 Correct 375 ms 23284 KB Output is correct
93 Correct 413 ms 204508 KB Output is correct
94 Correct 2738 ms 90040 KB Output is correct
95 Correct 405 ms 204684 KB Output is correct
96 Correct 416 ms 205496 KB Output is correct
97 Correct 2118 ms 66148 KB Output is correct
98 Correct 423 ms 190392 KB Output is correct
99 Correct 402 ms 205492 KB Output is correct
100 Correct 373 ms 205272 KB Output is correct
101 Correct 552 ms 207032 KB Output is correct
102 Correct 417 ms 205492 KB Output is correct
103 Execution timed out 3041 ms 89084 KB Time limit exceeded
104 Halted 0 ms 0 KB -