oj.uz

답안 #851459

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
851459 2023-09-19T20:34:27 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 240568 KB 
#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;
	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) {
		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 >= (long long)y + 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--;
			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;
			if (T[p].s.size()) 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], 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:126:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  126 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:126:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  126 |  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 6488 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 6488 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 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 4 ms 8284 KB Output is correct
20 Correct 4 ms 8420 KB Output is correct
21 Correct 5 ms 8280 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 9 ms 9372 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8636 KB Output is correct
26 Correct 5 ms 9204 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 381 ms 120464 KB Output is correct
2 Correct 386 ms 121000 KB Output is correct
3 Correct 368 ms 120128 KB Output is correct
4 Correct 371 ms 121120 KB Output is correct
5 Correct 320 ms 68768 KB Output is correct
6 Correct 393 ms 130920 KB Output is correct
7 Correct 355 ms 123572 KB Output is correct
8 Correct 371 ms 126260 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 268 ms 57736 KB Output is correct
3 Correct 975 ms 187064 KB Output is correct
4 Correct 976 ms 185720 KB Output is correct
5 Correct 1364 ms 184356 KB Output is correct
6 Correct 411 ms 85948 KB Output is correct
7 Correct 132 ms 44224 KB Output is correct
8 Correct 15 ms 14556 KB Output is correct
9 Correct 1090 ms 189464 KB Output is correct
10 Correct 1558 ms 178916 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 728 ms 177640 KB Output is correct
2 Correct 318 ms 142008 KB Output is correct
3 Correct 681 ms 127944 KB Output is correct
4 Correct 351 ms 144764 KB Output is correct
5 Correct 361 ms 143544 KB Output is correct
6 Correct 561 ms 122036 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 6488 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 6488 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 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 4 ms 8284 KB Output is correct
20 Correct 4 ms 8420 KB Output is correct
21 Correct 5 ms 8280 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 9 ms 9372 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8636 KB Output is correct
26 Correct 5 ms 9204 KB Output is correct
27 Correct 8 ms 10076 KB Output is correct
28 Correct 8 ms 10072 KB Output is correct
29 Correct 8 ms 10076 KB Output is correct
30 Correct 13 ms 11868 KB Output is correct
31 Correct 10 ms 11364 KB Output is correct
32 Correct 10 ms 11100 KB Output is correct
33 Correct 94 ms 35084 KB Output is correct
34 Correct 97 ms 35012 KB Output is correct
35 Correct 106 ms 35352 KB Output is correct
36 Correct 143 ms 47716 KB Output is correct
37 Correct 163 ms 48204 KB Output is correct
38 Correct 202 ms 50556 KB Output is correct
39 Correct 106 ms 11456 KB Output is correct
40 Correct 105 ms 11456 KB Output is correct
41 Correct 105 ms 11460 KB Output is correct
42 Correct 114 ms 11720 KB Output is correct
43 Correct 96 ms 42076 KB Output is correct
44 Correct 94 ms 41440 KB Output is correct
45 Correct 98 ms 41908 KB Output is correct
46 Correct 95 ms 41860 KB Output is correct
47 Correct 93 ms 41036 KB Output is correct
48 Correct 103 ms 41816 KB Output is correct
49 Correct 96 ms 40648 KB Output is correct
50 Correct 100 ms 41360 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 6488 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 6488 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 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 4 ms 8284 KB Output is correct
20 Correct 4 ms 8420 KB Output is correct
21 Correct 5 ms 8280 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 9 ms 9372 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8636 KB Output is correct
26 Correct 5 ms 9204 KB Output is correct
27 Correct 381 ms 120464 KB Output is correct
28 Correct 386 ms 121000 KB Output is correct
29 Correct 368 ms 120128 KB Output is correct
30 Correct 371 ms 121120 KB Output is correct
31 Correct 320 ms 68768 KB Output is correct
32 Correct 393 ms 130920 KB Output is correct
33 Correct 355 ms 123572 KB Output is correct
34 Correct 371 ms 126260 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 268 ms 57736 KB Output is correct
37 Correct 975 ms 187064 KB Output is correct
38 Correct 976 ms 185720 KB Output is correct
39 Correct 1364 ms 184356 KB Output is correct
40 Correct 411 ms 85948 KB Output is correct
41 Correct 132 ms 44224 KB Output is correct
42 Correct 15 ms 14556 KB Output is correct
43 Correct 1090 ms 189464 KB Output is correct
44 Correct 1558 ms 178916 KB Output is correct
45 Correct 728 ms 177640 KB Output is correct
46 Correct 318 ms 142008 KB Output is correct
47 Correct 681 ms 127944 KB Output is correct
48 Correct 351 ms 144764 KB Output is correct
49 Correct 361 ms 143544 KB Output is correct
50 Correct 561 ms 122036 KB Output is correct
51 Correct 8 ms 10076 KB Output is correct
52 Correct 8 ms 10072 KB Output is correct
53 Correct 8 ms 10076 KB Output is correct
54 Correct 13 ms 11868 KB Output is correct
55 Correct 10 ms 11364 KB Output is correct
56 Correct 10 ms 11100 KB Output is correct
57 Correct 94 ms 35084 KB Output is correct
58 Correct 97 ms 35012 KB Output is correct
59 Correct 106 ms 35352 KB Output is correct
60 Correct 143 ms 47716 KB Output is correct
61 Correct 163 ms 48204 KB Output is correct
62 Correct 202 ms 50556 KB Output is correct
63 Correct 106 ms 11456 KB Output is correct
64 Correct 105 ms 11456 KB Output is correct
65 Correct 105 ms 11460 KB Output is correct
66 Correct 114 ms 11720 KB Output is correct
67 Correct 96 ms 42076 KB Output is correct
68 Correct 94 ms 41440 KB Output is correct
69 Correct 98 ms 41908 KB Output is correct
70 Correct 95 ms 41860 KB Output is correct
71 Correct 93 ms 41036 KB Output is correct
72 Correct 103 ms 41816 KB Output is correct
73 Correct 96 ms 40648 KB Output is correct
74 Correct 100 ms 41360 KB Output is correct
75 Correct 383 ms 120300 KB Output is correct
76 Correct 376 ms 121252 KB Output is correct
77 Correct 347 ms 120140 KB Output is correct
78 Correct 374 ms 120340 KB Output is correct
79 Correct 456 ms 120668 KB Output is correct
80 Correct 370 ms 119428 KB Output is correct
81 Correct 879 ms 180340 KB Output is correct
82 Correct 762 ms 172200 KB Output is correct
83 Correct 731 ms 171788 KB Output is correct
84 Correct 1192 ms 195436 KB Output is correct
85 Correct 833 ms 177848 KB Output is correct
86 Correct 692 ms 169340 KB Output is correct
87 Correct 2626 ms 240568 KB Output is correct
88 Correct 427 ms 23312 KB Output is correct
89 Correct 371 ms 22816 KB Output is correct
90 Correct 384 ms 22548 KB Output is correct
91 Correct 418 ms 21836 KB Output is correct
92 Correct 395 ms 22712 KB Output is correct
93 Correct 370 ms 142440 KB Output is correct
94 Execution timed out 3064 ms 91080 KB Time limit exceeded
95 Halted 0 ms 0 KB -