oj.uz

답안 #851380

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
851380 2023-09-19T17:16:06 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 238240 KB 
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#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 (pii(R[cand], -cand) < pii(R[t], -t)) return;
	if (intersect(cur, cand)) t = cand;
}
 
struct SegTree {
	struct Node {
		set<pii> s;
	};
 
	int n, base;
	vector<Node> T;
 
	SegTree(int _n) : n(_n) {
		for (base = 1; base < n; base <<= 1);
		T.resize(base + base);
	}
 
	void chk_node(int idx, int y, int r) {
		auto it = T[idx].s.lower_bound({y, 0});
		auto tmp = it;
		for (int i = 0; i < K; i++) {
			if (it == T[idx].s.end()) break;
			chk(it->second);
			if (it->first >= y + r) break;
			if (i < K - 1) it++;
		}
		it = tmp;
		for (int i = 0; i < K; i++) {
			if (it == T[idx].s.begin()) break;
			it--;
			chk(it->second);
			if (it->first <= y - 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) {
		p += base; p--;
		while (p >= 1) {
			chk_node(p, y, r);
			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]);
		seg.get(XR[i], Y[i], R[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:123:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  123 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:123:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  123 |  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 6488 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6496 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 1 ms 6576 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6496 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6744 KB Output is correct
17 Correct 2 ms 6744 KB Output is correct
18 Correct 1 ms 6744 KB Output is correct
19 Correct 5 ms 8280 KB Output is correct
20 Correct 4 ms 8280 KB Output is correct
21 Correct 4 ms 8280 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 9 ms 9304 KB Output is correct
24 Correct 5 ms 8536 KB Output is correct
25 Correct 5 ms 8280 KB Output is correct
26 Correct 5 ms 8536 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 358 ms 116848 KB Output is correct
2 Correct 358 ms 115384 KB Output is correct
3 Correct 389 ms 116148 KB Output is correct
4 Correct 352 ms 115656 KB Output is correct
5 Correct 310 ms 66096 KB Output is correct
6 Correct 405 ms 126584 KB Output is correct
7 Correct 361 ms 117012 KB Output is correct
8 Correct 357 ms 119988 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 257 ms 56884 KB Output is correct
3 Correct 933 ms 182452 KB Output is correct
4 Correct 926 ms 182956 KB Output is correct
5 Correct 1203 ms 180072 KB Output is correct
6 Correct 399 ms 84072 KB Output is correct
7 Correct 148 ms 43664 KB Output is correct
8 Correct 15 ms 14036 KB Output is correct
9 Correct 1055 ms 184904 KB Output is correct
10 Correct 1472 ms 175140 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 676 ms 174244 KB Output is correct
2 Correct 308 ms 137908 KB Output is correct
3 Correct 661 ms 124428 KB Output is correct
4 Correct 356 ms 145096 KB Output is correct
5 Correct 336 ms 142672 KB Output is correct
6 Correct 559 ms 120608 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 6488 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6496 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 1 ms 6576 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6496 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6744 KB Output is correct
17 Correct 2 ms 6744 KB Output is correct
18 Correct 1 ms 6744 KB Output is correct
19 Correct 5 ms 8280 KB Output is correct
20 Correct 4 ms 8280 KB Output is correct
21 Correct 4 ms 8280 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 9 ms 9304 KB Output is correct
24 Correct 5 ms 8536 KB Output is correct
25 Correct 5 ms 8280 KB Output is correct
26 Correct 5 ms 8536 KB Output is correct
27 Correct 9 ms 9816 KB Output is correct
28 Correct 8 ms 9816 KB Output is correct
29 Correct 8 ms 9816 KB Output is correct
30 Correct 13 ms 11608 KB Output is correct
31 Correct 10 ms 10840 KB Output is correct
32 Correct 11 ms 10840 KB Output is correct
33 Correct 90 ms 34672 KB Output is correct
34 Correct 93 ms 34500 KB Output is correct
35 Correct 111 ms 34756 KB Output is correct
36 Correct 146 ms 46984 KB Output is correct
37 Correct 140 ms 47520 KB Output is correct
38 Correct 186 ms 50116 KB Output is correct
39 Correct 114 ms 11716 KB Output is correct
40 Correct 112 ms 11808 KB Output is correct
41 Correct 111 ms 11760 KB Output is correct
42 Correct 117 ms 12292 KB Output is correct
43 Correct 99 ms 41348 KB Output is correct
44 Correct 94 ms 40648 KB Output is correct
45 Correct 97 ms 41080 KB Output is correct
46 Correct 95 ms 41148 KB Output is correct
47 Correct 99 ms 40572 KB Output is correct
48 Correct 95 ms 41088 KB Output is correct
49 Correct 91 ms 39876 KB Output is correct
50 Correct 94 ms 40852 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 6488 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6496 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 1 ms 6576 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6496 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6744 KB Output is correct
17 Correct 2 ms 6744 KB Output is correct
18 Correct 1 ms 6744 KB Output is correct
19 Correct 5 ms 8280 KB Output is correct
20 Correct 4 ms 8280 KB Output is correct
21 Correct 4 ms 8280 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 9 ms 9304 KB Output is correct
24 Correct 5 ms 8536 KB Output is correct
25 Correct 5 ms 8280 KB Output is correct
26 Correct 5 ms 8536 KB Output is correct
27 Correct 358 ms 116848 KB Output is correct
28 Correct 358 ms 115384 KB Output is correct
29 Correct 389 ms 116148 KB Output is correct
30 Correct 352 ms 115656 KB Output is correct
31 Correct 310 ms 66096 KB Output is correct
32 Correct 405 ms 126584 KB Output is correct
33 Correct 361 ms 117012 KB Output is correct
34 Correct 357 ms 119988 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 257 ms 56884 KB Output is correct
37 Correct 933 ms 182452 KB Output is correct
38 Correct 926 ms 182956 KB Output is correct
39 Correct 1203 ms 180072 KB Output is correct
40 Correct 399 ms 84072 KB Output is correct
41 Correct 148 ms 43664 KB Output is correct
42 Correct 15 ms 14036 KB Output is correct
43 Correct 1055 ms 184904 KB Output is correct
44 Correct 1472 ms 175140 KB Output is correct
45 Correct 676 ms 174244 KB Output is correct
46 Correct 308 ms 137908 KB Output is correct
47 Correct 661 ms 124428 KB Output is correct
48 Correct 356 ms 145096 KB Output is correct
49 Correct 336 ms 142672 KB Output is correct
50 Correct 559 ms 120608 KB Output is correct
51 Correct 9 ms 9816 KB Output is correct
52 Correct 8 ms 9816 KB Output is correct
53 Correct 8 ms 9816 KB Output is correct
54 Correct 13 ms 11608 KB Output is correct
55 Correct 10 ms 10840 KB Output is correct
56 Correct 11 ms 10840 KB Output is correct
57 Correct 90 ms 34672 KB Output is correct
58 Correct 93 ms 34500 KB Output is correct
59 Correct 111 ms 34756 KB Output is correct
60 Correct 146 ms 46984 KB Output is correct
61 Correct 140 ms 47520 KB Output is correct
62 Correct 186 ms 50116 KB Output is correct
63 Correct 114 ms 11716 KB Output is correct
64 Correct 112 ms 11808 KB Output is correct
65 Correct 111 ms 11760 KB Output is correct
66 Correct 117 ms 12292 KB Output is correct
67 Correct 99 ms 41348 KB Output is correct
68 Correct 94 ms 40648 KB Output is correct
69 Correct 97 ms 41080 KB Output is correct
70 Correct 95 ms 41148 KB Output is correct
71 Correct 99 ms 40572 KB Output is correct
72 Correct 95 ms 41088 KB Output is correct
73 Correct 91 ms 39876 KB Output is correct
74 Correct 94 ms 40852 KB Output is correct
75 Correct 363 ms 119308 KB Output is correct
76 Correct 370 ms 119568 KB Output is correct
77 Correct 325 ms 118892 KB Output is correct
78 Correct 355 ms 119144 KB Output is correct
79 Correct 438 ms 119144 KB Output is correct
80 Correct 346 ms 118452 KB Output is correct
81 Correct 875 ms 178868 KB Output is correct
82 Correct 784 ms 169172 KB Output is correct
83 Correct 716 ms 170496 KB Output is correct
84 Correct 1223 ms 194128 KB Output is correct
85 Correct 896 ms 176108 KB Output is correct
86 Correct 694 ms 167864 KB Output is correct
87 Correct 2659 ms 238240 KB Output is correct
88 Correct 456 ms 25684 KB Output is correct
89 Correct 434 ms 25844 KB Output is correct
90 Correct 396 ms 26948 KB Output is correct
91 Correct 428 ms 25344 KB Output is correct
92 Correct 404 ms 26568 KB Output is correct
93 Correct 364 ms 141580 KB Output is correct
94 Execution timed out 3011 ms 99252 KB Time limit exceeded
95 Halted 0 ms 0 KB -