oj.uz

답안 #855765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
855765 2023-10-01T18:19:42 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 240276 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 {
	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];
	}

	inline void chk_node(int idx, int y, int r) {
		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);
			}
		}
	}

	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 << 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:129:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  129 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:129:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  129 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |                                                      ^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 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 6592 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 6488 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 6492 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 4 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 4 ms 8284 KB Output is correct
22 Correct 6 ms 8796 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 372 ms 119700 KB Output is correct
2 Correct 362 ms 120500 KB Output is correct
3 Correct 354 ms 119704 KB Output is correct
4 Correct 351 ms 121268 KB Output is correct
5 Correct 302 ms 68332 KB Output is correct
6 Correct 355 ms 130484 KB Output is correct
7 Correct 346 ms 122296 KB Output is correct
8 Correct 346 ms 125716 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 233 ms 57288 KB Output is correct
3 Correct 923 ms 186840 KB Output is correct
4 Correct 873 ms 184988 KB Output is correct
5 Correct 1132 ms 183696 KB Output is correct
6 Correct 423 ms 85912 KB Output is correct
7 Correct 126 ms 44228 KB Output is correct
8 Correct 16 ms 14552 KB Output is correct
9 Correct 1002 ms 189236 KB Output is correct
10 Correct 1434 ms 178532 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 647 ms 178000 KB Output is correct
2 Correct 329 ms 140964 KB Output is correct
3 Correct 640 ms 127508 KB Output is correct
4 Correct 342 ms 144820 KB Output is correct
5 Correct 323 ms 142368 KB Output is correct
6 Correct 547 ms 121016 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 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 6592 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 6488 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 6492 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 4 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 4 ms 8284 KB Output is correct
22 Correct 6 ms 8796 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 10072 KB Output is correct
28 Correct 8 ms 10076 KB Output is correct
29 Correct 8 ms 10072 KB Output is correct
30 Correct 13 ms 11868 KB Output is correct
31 Correct 10 ms 11100 KB Output is correct
32 Correct 10 ms 11120 KB Output is correct
33 Correct 89 ms 35012 KB Output is correct
34 Correct 95 ms 35144 KB Output is correct
35 Correct 100 ms 35152 KB Output is correct
36 Correct 137 ms 47712 KB Output is correct
37 Correct 137 ms 48216 KB Output is correct
38 Correct 160 ms 50368 KB Output is correct
39 Correct 104 ms 11552 KB Output is correct
40 Correct 107 ms 11460 KB Output is correct
41 Correct 104 ms 11712 KB Output is correct
42 Correct 119 ms 12028 KB Output is correct
43 Correct 91 ms 41928 KB Output is correct
44 Correct 87 ms 41412 KB Output is correct
45 Correct 93 ms 41928 KB Output is correct
46 Correct 89 ms 41808 KB Output is correct
47 Correct 91 ms 40900 KB Output is correct
48 Correct 91 ms 41816 KB Output is correct
49 Correct 86 ms 40536 KB Output is correct
50 Correct 89 ms 41416 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 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 6592 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 6488 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 6492 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 4 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 4 ms 8284 KB Output is correct
22 Correct 6 ms 8796 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 372 ms 119700 KB Output is correct
28 Correct 362 ms 120500 KB Output is correct
29 Correct 354 ms 119704 KB Output is correct
30 Correct 351 ms 121268 KB Output is correct
31 Correct 302 ms 68332 KB Output is correct
32 Correct 355 ms 130484 KB Output is correct
33 Correct 346 ms 122296 KB Output is correct
34 Correct 346 ms 125716 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 233 ms 57288 KB Output is correct
37 Correct 923 ms 186840 KB Output is correct
38 Correct 873 ms 184988 KB Output is correct
39 Correct 1132 ms 183696 KB Output is correct
40 Correct 423 ms 85912 KB Output is correct
41 Correct 126 ms 44228 KB Output is correct
42 Correct 16 ms 14552 KB Output is correct
43 Correct 1002 ms 189236 KB Output is correct
44 Correct 1434 ms 178532 KB Output is correct
45 Correct 647 ms 178000 KB Output is correct
46 Correct 329 ms 140964 KB Output is correct
47 Correct 640 ms 127508 KB Output is correct
48 Correct 342 ms 144820 KB Output is correct
49 Correct 323 ms 142368 KB Output is correct
50 Correct 547 ms 121016 KB Output is correct
51 Correct 8 ms 10072 KB Output is correct
52 Correct 8 ms 10076 KB Output is correct
53 Correct 8 ms 10072 KB Output is correct
54 Correct 13 ms 11868 KB Output is correct
55 Correct 10 ms 11100 KB Output is correct
56 Correct 10 ms 11120 KB Output is correct
57 Correct 89 ms 35012 KB Output is correct
58 Correct 95 ms 35144 KB Output is correct
59 Correct 100 ms 35152 KB Output is correct
60 Correct 137 ms 47712 KB Output is correct
61 Correct 137 ms 48216 KB Output is correct
62 Correct 160 ms 50368 KB Output is correct
63 Correct 104 ms 11552 KB Output is correct
64 Correct 107 ms 11460 KB Output is correct
65 Correct 104 ms 11712 KB Output is correct
66 Correct 119 ms 12028 KB Output is correct
67 Correct 91 ms 41928 KB Output is correct
68 Correct 87 ms 41412 KB Output is correct
69 Correct 93 ms 41928 KB Output is correct
70 Correct 89 ms 41808 KB Output is correct
71 Correct 91 ms 40900 KB Output is correct
72 Correct 91 ms 41816 KB Output is correct
73 Correct 86 ms 40536 KB Output is correct
74 Correct 89 ms 41416 KB Output is correct
75 Correct 367 ms 120412 KB Output is correct
76 Correct 362 ms 120688 KB Output is correct
77 Correct 361 ms 119676 KB Output is correct
78 Correct 353 ms 121016 KB Output is correct
79 Correct 431 ms 121528 KB Output is correct
80 Correct 350 ms 119496 KB Output is correct
81 Correct 820 ms 180280 KB Output is correct
82 Correct 674 ms 171448 KB Output is correct
83 Correct 678 ms 171924 KB Output is correct
84 Correct 1125 ms 197112 KB Output is correct
85 Correct 761 ms 177768 KB Output is correct
86 Correct 652 ms 170676 KB Output is correct
87 Correct 2457 ms 240276 KB Output is correct
88 Correct 386 ms 22584 KB Output is correct
89 Correct 366 ms 22928 KB Output is correct
90 Correct 366 ms 22988 KB Output is correct
91 Correct 363 ms 23480 KB Output is correct
92 Correct 380 ms 22724 KB Output is correct
93 Correct 337 ms 142260 KB Output is correct
94 Correct 2702 ms 90212 KB Output is correct
95 Correct 333 ms 142768 KB Output is correct
96 Correct 350 ms 142008 KB Output is correct
97 Correct 2008 ms 67224 KB Output is correct
98 Correct 369 ms 133044 KB Output is correct
99 Correct 347 ms 141752 KB Output is correct
100 Correct 316 ms 141072 KB Output is correct
101 Correct 480 ms 144080 KB Output is correct
102 Correct 355 ms 141240 KB Output is correct
103 Execution timed out 3052 ms 87972 KB Time limit exceeded
104 Halted 0 ms 0 KB -