oj.uz

답안 #855755

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
855755 2023-10-01T17:59:55 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 239936 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#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 {
	struct Node {
		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, int li) {
		auto it = T[idx].s.lower_bound({y, 0});
		auto tmp = it;
		if (it != T[idx].s.end()) {
			chk(it->second);
			if (it->first < (long long)y + r + r && XL[it->second] > li) {
				++it;
				if (it != T[idx].s.end()) chk(it->second);
			}
		}
		// 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;
		if (it != T[idx].s.begin()) {
			--it;
			chk(it->second);
			if (it->first > (long long)y - r - r && it != T[idx].s.begin() && XL[it->second] > li) {
				chk(prev(it)->second);
			}
		}
		// 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++].s.insert(x);
			if (~q & 1) 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, 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:144:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  144 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:144:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  144 |  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 3 ms 6596 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 2 ms 6744 KB Output is correct
18 Correct 2 ms 6744 KB Output is correct
19 Correct 4 ms 8280 KB Output is correct
20 Correct 4 ms 8284 KB Output is correct
21 Correct 4 ms 8280 KB Output is correct
22 Correct 6 ms 8792 KB Output is correct
23 Correct 9 ms 9560 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 353 ms 120212 KB Output is correct
2 Correct 371 ms 121292 KB Output is correct
3 Correct 379 ms 120544 KB Output is correct
4 Correct 350 ms 120880 KB Output is correct
5 Correct 309 ms 67764 KB Output is correct
6 Correct 377 ms 131256 KB Output is correct
7 Correct 346 ms 123000 KB Output is correct
8 Correct 344 ms 126088 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 280 ms 57280 KB Output is correct
3 Correct 939 ms 186228 KB Output is correct
4 Correct 893 ms 185608 KB Output is correct
5 Correct 1200 ms 184216 KB Output is correct
6 Correct 430 ms 85836 KB Output is correct
7 Correct 122 ms 44476 KB Output is correct
8 Correct 15 ms 14552 KB Output is correct
9 Correct 1024 ms 187996 KB Output is correct
10 Correct 1452 ms 178264 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 635 ms 177604 KB Output is correct
2 Correct 308 ms 141860 KB Output is correct
3 Correct 624 ms 126696 KB Output is correct
4 Correct 340 ms 146228 KB Output is correct
5 Correct 336 ms 142096 KB Output is correct
6 Correct 549 ms 122288 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 3 ms 6596 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 2 ms 6744 KB Output is correct
18 Correct 2 ms 6744 KB Output is correct
19 Correct 4 ms 8280 KB Output is correct
20 Correct 4 ms 8284 KB Output is correct
21 Correct 4 ms 8280 KB Output is correct
22 Correct 6 ms 8792 KB Output is correct
23 Correct 9 ms 9560 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 8 ms 10076 KB Output is correct
28 Correct 8 ms 10208 KB Output is correct
29 Correct 8 ms 10072 KB Output is correct
30 Correct 12 ms 11868 KB Output is correct
31 Correct 10 ms 11188 KB Output is correct
32 Correct 9 ms 10920 KB Output is correct
33 Correct 99 ms 35128 KB Output is correct
34 Correct 92 ms 35012 KB Output is correct
35 Correct 101 ms 35016 KB Output is correct
36 Correct 137 ms 47808 KB Output is correct
37 Correct 141 ms 48228 KB Output is correct
38 Correct 190 ms 50504 KB Output is correct
39 Correct 127 ms 11460 KB Output is correct
40 Correct 106 ms 11460 KB Output is correct
41 Correct 107 ms 11464 KB Output is correct
42 Correct 112 ms 11720 KB Output is correct
43 Correct 91 ms 42140 KB Output is correct
44 Correct 91 ms 41216 KB Output is correct
45 Correct 90 ms 41920 KB Output is correct
46 Correct 90 ms 41932 KB Output is correct
47 Correct 88 ms 40976 KB Output is correct
48 Correct 89 ms 41924 KB Output is correct
49 Correct 86 ms 40712 KB Output is correct
50 Correct 88 ms 41416 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 3 ms 6596 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 2 ms 6744 KB Output is correct
18 Correct 2 ms 6744 KB Output is correct
19 Correct 4 ms 8280 KB Output is correct
20 Correct 4 ms 8284 KB Output is correct
21 Correct 4 ms 8280 KB Output is correct
22 Correct 6 ms 8792 KB Output is correct
23 Correct 9 ms 9560 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 353 ms 120212 KB Output is correct
28 Correct 371 ms 121292 KB Output is correct
29 Correct 379 ms 120544 KB Output is correct
30 Correct 350 ms 120880 KB Output is correct
31 Correct 309 ms 67764 KB Output is correct
32 Correct 377 ms 131256 KB Output is correct
33 Correct 346 ms 123000 KB Output is correct
34 Correct 344 ms 126088 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 280 ms 57280 KB Output is correct
37 Correct 939 ms 186228 KB Output is correct
38 Correct 893 ms 185608 KB Output is correct
39 Correct 1200 ms 184216 KB Output is correct
40 Correct 430 ms 85836 KB Output is correct
41 Correct 122 ms 44476 KB Output is correct
42 Correct 15 ms 14552 KB Output is correct
43 Correct 1024 ms 187996 KB Output is correct
44 Correct 1452 ms 178264 KB Output is correct
45 Correct 635 ms 177604 KB Output is correct
46 Correct 308 ms 141860 KB Output is correct
47 Correct 624 ms 126696 KB Output is correct
48 Correct 340 ms 146228 KB Output is correct
49 Correct 336 ms 142096 KB Output is correct
50 Correct 549 ms 122288 KB Output is correct
51 Correct 8 ms 10076 KB Output is correct
52 Correct 8 ms 10208 KB Output is correct
53 Correct 8 ms 10072 KB Output is correct
54 Correct 12 ms 11868 KB Output is correct
55 Correct 10 ms 11188 KB Output is correct
56 Correct 9 ms 10920 KB Output is correct
57 Correct 99 ms 35128 KB Output is correct
58 Correct 92 ms 35012 KB Output is correct
59 Correct 101 ms 35016 KB Output is correct
60 Correct 137 ms 47808 KB Output is correct
61 Correct 141 ms 48228 KB Output is correct
62 Correct 190 ms 50504 KB Output is correct
63 Correct 127 ms 11460 KB Output is correct
64 Correct 106 ms 11460 KB Output is correct
65 Correct 107 ms 11464 KB Output is correct
66 Correct 112 ms 11720 KB Output is correct
67 Correct 91 ms 42140 KB Output is correct
68 Correct 91 ms 41216 KB Output is correct
69 Correct 90 ms 41920 KB Output is correct
70 Correct 90 ms 41932 KB Output is correct
71 Correct 88 ms 40976 KB Output is correct
72 Correct 89 ms 41924 KB Output is correct
73 Correct 86 ms 40712 KB Output is correct
74 Correct 88 ms 41416 KB Output is correct
75 Correct 386 ms 120600 KB Output is correct
76 Correct 363 ms 119900 KB Output is correct
77 Correct 327 ms 121008 KB Output is correct
78 Correct 349 ms 120172 KB Output is correct
79 Correct 427 ms 121692 KB Output is correct
80 Correct 357 ms 120548 KB Output is correct
81 Correct 839 ms 182056 KB Output is correct
82 Correct 722 ms 172884 KB Output is correct
83 Correct 693 ms 173368 KB Output is correct
84 Correct 1118 ms 196672 KB Output is correct
85 Correct 770 ms 178100 KB Output is correct
86 Correct 663 ms 170936 KB Output is correct
87 Correct 2467 ms 239936 KB Output is correct
88 Correct 370 ms 22456 KB Output is correct
89 Correct 374 ms 21940 KB Output is correct
90 Correct 376 ms 23164 KB Output is correct
91 Correct 385 ms 22308 KB Output is correct
92 Correct 371 ms 22348 KB Output is correct
93 Correct 341 ms 142176 KB Output is correct
94 Correct 2770 ms 90648 KB Output is correct
95 Correct 334 ms 141952 KB Output is correct
96 Correct 349 ms 143016 KB Output is correct
97 Correct 2015 ms 66136 KB Output is correct
98 Correct 382 ms 134068 KB Output is correct
99 Correct 340 ms 141492 KB Output is correct
100 Correct 322 ms 141492 KB Output is correct
101 Correct 494 ms 144820 KB Output is correct
102 Correct 345 ms 141244 KB Output is correct
103 Execution timed out 3097 ms 88376 KB Time limit exceeded
104 Halted 0 ms 0 KB -