oj.uz

답안 #854747

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
854747 2023-09-28T17:37:53 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 239904 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];
	}

	void chk_node(int idx, int r, int li) {
		auto it = T[idx].s.lower_bound({Y[cur], 0});
		auto tmp = it;
		for (int i = 0; i < K; i++) {
			if (it == T[idx].s.end()) break;
			if (XL[it->second] <= li) break;
			chk(it->second);
			if (it->first >= (long long)Y[cur] + r + r) break;
			if (i < K - 1) it++;
		}
		it = tmp;
		for (int i = 0; i < K; i++) {
			if (it == T[idx].s.begin()) break;
			it--;
			if (XL[it->second] <= li) break;
			chk(it->second);
			if (it->first <= (long long)Y[cur] - 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 r, int li) {
		p += base; p--;
		while (p >= 1) {
			if (L[p] <= li) break;
			chk_node(p, 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], R[i], 0);
		seg.get(XR[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 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 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 6488 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 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 4 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 5 ms 8756 KB Output is correct
23 Correct 9 ms 9564 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8496 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 356 ms 120236 KB Output is correct
2 Correct 376 ms 121268 KB Output is correct
3 Correct 367 ms 119848 KB Output is correct
4 Correct 356 ms 121028 KB Output is correct
5 Correct 301 ms 68276 KB Output is correct
6 Correct 398 ms 130404 KB Output is correct
7 Correct 353 ms 122512 KB Output is correct
8 Correct 352 ms 126272 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 238 ms 57468 KB Output is correct
3 Correct 958 ms 187284 KB Output is correct
4 Correct 985 ms 185972 KB Output is correct
5 Correct 1217 ms 184492 KB Output is correct
6 Correct 397 ms 85924 KB Output is correct
7 Correct 131 ms 44248 KB Output is correct
8 Correct 16 ms 14552 KB Output is correct
9 Correct 1053 ms 188380 KB Output is correct
10 Correct 1558 ms 177912 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 692 ms 178020 KB Output is correct
2 Correct 308 ms 142408 KB Output is correct
3 Correct 653 ms 127600 KB Output is correct
4 Correct 377 ms 144756 KB Output is correct
5 Correct 337 ms 143032 KB Output is correct
6 Correct 572 ms 121016 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 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 6488 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 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 4 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 5 ms 8756 KB Output is correct
23 Correct 9 ms 9564 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8496 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 9 ms 10072 KB Output is correct
28 Correct 8 ms 10584 KB Output is correct
29 Correct 8 ms 10164 KB Output is correct
30 Correct 14 ms 11868 KB Output is correct
31 Correct 10 ms 11096 KB Output is correct
32 Correct 10 ms 11100 KB Output is correct
33 Correct 90 ms 35012 KB Output is correct
34 Correct 108 ms 35148 KB Output is correct
35 Correct 106 ms 35272 KB Output is correct
36 Correct 137 ms 47808 KB Output is correct
37 Correct 151 ms 48204 KB Output is correct
38 Correct 163 ms 50372 KB Output is correct
39 Correct 120 ms 11452 KB Output is correct
40 Correct 111 ms 11464 KB Output is correct
41 Correct 110 ms 11536 KB Output is correct
42 Correct 124 ms 11904 KB Output is correct
43 Correct 94 ms 42052 KB Output is correct
44 Correct 94 ms 41228 KB Output is correct
45 Correct 92 ms 41868 KB Output is correct
46 Correct 94 ms 41808 KB Output is correct
47 Correct 103 ms 40904 KB Output is correct
48 Correct 91 ms 41924 KB Output is correct
49 Correct 88 ms 40864 KB Output is correct
50 Correct 99 ms 41624 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 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 6488 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 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 4 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 5 ms 8756 KB Output is correct
23 Correct 9 ms 9564 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8496 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 356 ms 120236 KB Output is correct
28 Correct 376 ms 121268 KB Output is correct
29 Correct 367 ms 119848 KB Output is correct
30 Correct 356 ms 121028 KB Output is correct
31 Correct 301 ms 68276 KB Output is correct
32 Correct 398 ms 130404 KB Output is correct
33 Correct 353 ms 122512 KB Output is correct
34 Correct 352 ms 126272 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 238 ms 57468 KB Output is correct
37 Correct 958 ms 187284 KB Output is correct
38 Correct 985 ms 185972 KB Output is correct
39 Correct 1217 ms 184492 KB Output is correct
40 Correct 397 ms 85924 KB Output is correct
41 Correct 131 ms 44248 KB Output is correct
42 Correct 16 ms 14552 KB Output is correct
43 Correct 1053 ms 188380 KB Output is correct
44 Correct 1558 ms 177912 KB Output is correct
45 Correct 692 ms 178020 KB Output is correct
46 Correct 308 ms 142408 KB Output is correct
47 Correct 653 ms 127600 KB Output is correct
48 Correct 377 ms 144756 KB Output is correct
49 Correct 337 ms 143032 KB Output is correct
50 Correct 572 ms 121016 KB Output is correct
51 Correct 9 ms 10072 KB Output is correct
52 Correct 8 ms 10584 KB Output is correct
53 Correct 8 ms 10164 KB Output is correct
54 Correct 14 ms 11868 KB Output is correct
55 Correct 10 ms 11096 KB Output is correct
56 Correct 10 ms 11100 KB Output is correct
57 Correct 90 ms 35012 KB Output is correct
58 Correct 108 ms 35148 KB Output is correct
59 Correct 106 ms 35272 KB Output is correct
60 Correct 137 ms 47808 KB Output is correct
61 Correct 151 ms 48204 KB Output is correct
62 Correct 163 ms 50372 KB Output is correct
63 Correct 120 ms 11452 KB Output is correct
64 Correct 111 ms 11464 KB Output is correct
65 Correct 110 ms 11536 KB Output is correct
66 Correct 124 ms 11904 KB Output is correct
67 Correct 94 ms 42052 KB Output is correct
68 Correct 94 ms 41228 KB Output is correct
69 Correct 92 ms 41868 KB Output is correct
70 Correct 94 ms 41808 KB Output is correct
71 Correct 103 ms 40904 KB Output is correct
72 Correct 91 ms 41924 KB Output is correct
73 Correct 88 ms 40864 KB Output is correct
74 Correct 99 ms 41624 KB Output is correct
75 Correct 384 ms 120372 KB Output is correct
76 Correct 384 ms 120804 KB Output is correct
77 Correct 333 ms 119736 KB Output is correct
78 Correct 366 ms 121120 KB Output is correct
79 Correct 450 ms 120248 KB Output is correct
80 Correct 348 ms 119412 KB Output is correct
81 Correct 862 ms 180288 KB Output is correct
82 Correct 714 ms 172100 KB Output is correct
83 Correct 715 ms 172036 KB Output is correct
84 Correct 1202 ms 196096 KB Output is correct
85 Correct 845 ms 178352 KB Output is correct
86 Correct 672 ms 169336 KB Output is correct
87 Correct 2573 ms 239904 KB Output is correct
88 Correct 386 ms 21944 KB Output is correct
89 Correct 416 ms 22128 KB Output is correct
90 Correct 411 ms 22200 KB Output is correct
91 Correct 390 ms 22396 KB Output is correct
92 Correct 411 ms 23160 KB Output is correct
93 Correct 342 ms 142172 KB Output is correct
94 Execution timed out 3053 ms 90284 KB Time limit exceeded
95 Halted 0 ms 0 KB -