oj.uz

답안 #852003

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852003 2023-09-21T05:22:29 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 246268 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;
			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 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 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6740 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 6744 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 8796 KB Output is correct
23 Correct 10 ms 9560 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 4 ms 8412 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 380 ms 120552 KB Output is correct
2 Correct 400 ms 120152 KB Output is correct
3 Correct 373 ms 119988 KB Output is correct
4 Correct 378 ms 120988 KB Output is correct
5 Correct 314 ms 68912 KB Output is correct
6 Correct 378 ms 131664 KB Output is correct
7 Correct 350 ms 122424 KB Output is correct
8 Correct 373 ms 124888 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 283 ms 57296 KB Output is correct
3 Correct 956 ms 186652 KB Output is correct
4 Correct 977 ms 187068 KB Output is correct
5 Correct 1221 ms 183060 KB Output is correct
6 Correct 431 ms 85852 KB Output is correct
7 Correct 137 ms 44232 KB Output is correct
8 Correct 19 ms 14548 KB Output is correct
9 Correct 1073 ms 188264 KB Output is correct
10 Correct 1580 ms 179156 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 718 ms 176616 KB Output is correct
2 Correct 309 ms 141752 KB Output is correct
3 Correct 706 ms 128416 KB Output is correct
4 Correct 368 ms 151812 KB Output is correct
5 Correct 333 ms 149552 KB Output is correct
6 Correct 611 ms 128892 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 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6740 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 6744 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 8796 KB Output is correct
23 Correct 10 ms 9560 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 4 ms 8412 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 8 ms 10076 KB Output is correct
28 Correct 9 ms 10076 KB Output is correct
29 Correct 9 ms 10148 KB Output is correct
30 Correct 15 ms 11868 KB Output is correct
31 Correct 11 ms 11100 KB Output is correct
32 Correct 10 ms 11096 KB Output is correct
33 Correct 93 ms 34976 KB Output is correct
34 Correct 99 ms 35164 KB Output is correct
35 Correct 104 ms 35016 KB Output is correct
36 Correct 156 ms 47756 KB Output is correct
37 Correct 149 ms 48272 KB Output is correct
38 Correct 173 ms 50508 KB Output is correct
39 Correct 111 ms 11688 KB Output is correct
40 Correct 110 ms 11564 KB Output is correct
41 Correct 110 ms 11452 KB Output is correct
42 Correct 119 ms 11740 KB Output is correct
43 Correct 102 ms 42040 KB Output is correct
44 Correct 100 ms 41364 KB Output is correct
45 Correct 94 ms 41948 KB Output is correct
46 Correct 96 ms 41772 KB Output is correct
47 Correct 100 ms 41132 KB Output is correct
48 Correct 97 ms 41912 KB Output is correct
49 Correct 100 ms 40728 KB Output is correct
50 Correct 94 ms 41300 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 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6740 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 6744 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 8796 KB Output is correct
23 Correct 10 ms 9560 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 4 ms 8412 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 380 ms 120552 KB Output is correct
28 Correct 400 ms 120152 KB Output is correct
29 Correct 373 ms 119988 KB Output is correct
30 Correct 378 ms 120988 KB Output is correct
31 Correct 314 ms 68912 KB Output is correct
32 Correct 378 ms 131664 KB Output is correct
33 Correct 350 ms 122424 KB Output is correct
34 Correct 373 ms 124888 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 283 ms 57296 KB Output is correct
37 Correct 956 ms 186652 KB Output is correct
38 Correct 977 ms 187068 KB Output is correct
39 Correct 1221 ms 183060 KB Output is correct
40 Correct 431 ms 85852 KB Output is correct
41 Correct 137 ms 44232 KB Output is correct
42 Correct 19 ms 14548 KB Output is correct
43 Correct 1073 ms 188264 KB Output is correct
44 Correct 1580 ms 179156 KB Output is correct
45 Correct 718 ms 176616 KB Output is correct
46 Correct 309 ms 141752 KB Output is correct
47 Correct 706 ms 128416 KB Output is correct
48 Correct 368 ms 151812 KB Output is correct
49 Correct 333 ms 149552 KB Output is correct
50 Correct 611 ms 128892 KB Output is correct
51 Correct 8 ms 10076 KB Output is correct
52 Correct 9 ms 10076 KB Output is correct
53 Correct 9 ms 10148 KB Output is correct
54 Correct 15 ms 11868 KB Output is correct
55 Correct 11 ms 11100 KB Output is correct
56 Correct 10 ms 11096 KB Output is correct
57 Correct 93 ms 34976 KB Output is correct
58 Correct 99 ms 35164 KB Output is correct
59 Correct 104 ms 35016 KB Output is correct
60 Correct 156 ms 47756 KB Output is correct
61 Correct 149 ms 48272 KB Output is correct
62 Correct 173 ms 50508 KB Output is correct
63 Correct 111 ms 11688 KB Output is correct
64 Correct 110 ms 11564 KB Output is correct
65 Correct 110 ms 11452 KB Output is correct
66 Correct 119 ms 11740 KB Output is correct
67 Correct 102 ms 42040 KB Output is correct
68 Correct 100 ms 41364 KB Output is correct
69 Correct 94 ms 41948 KB Output is correct
70 Correct 96 ms 41772 KB Output is correct
71 Correct 100 ms 41132 KB Output is correct
72 Correct 97 ms 41912 KB Output is correct
73 Correct 100 ms 40728 KB Output is correct
74 Correct 94 ms 41300 KB Output is correct
75 Correct 410 ms 128376 KB Output is correct
76 Correct 448 ms 126732 KB Output is correct
77 Correct 373 ms 128200 KB Output is correct
78 Correct 390 ms 126732 KB Output is correct
79 Correct 495 ms 127584 KB Output is correct
80 Correct 383 ms 126736 KB Output is correct
81 Correct 911 ms 187700 KB Output is correct
82 Correct 787 ms 177916 KB Output is correct
83 Correct 769 ms 178484 KB Output is correct
84 Correct 1221 ms 203692 KB Output is correct
85 Correct 889 ms 184596 KB Output is correct
86 Correct 716 ms 176560 KB Output is correct
87 Correct 2883 ms 246268 KB Output is correct
88 Correct 517 ms 26616 KB Output is correct
89 Correct 401 ms 26568 KB Output is correct
90 Correct 421 ms 24984 KB Output is correct
91 Correct 467 ms 26312 KB Output is correct
92 Correct 452 ms 25484 KB Output is correct
93 Correct 368 ms 146560 KB Output is correct
94 Execution timed out 3040 ms 96372 KB Time limit exceeded
95 Halted 0 ms 0 KB -