oj.uz

답안 #852004

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852004 2023-09-21T05:22:56 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
64 / 100
 1555 ms 188716 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 - 1; 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 6492 KB Output is correct
2 Correct 1 ms 6488 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 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 5 ms 8284 KB Output is correct
20 Correct 4 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 6 ms 8792 KB Output is correct
23 Correct 11 ms 9560 KB Output is correct
24 Correct 5 ms 8792 KB Output is correct
25 Correct 5 ms 8552 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 378 ms 120588 KB Output is correct
2 Correct 393 ms 120764 KB Output is correct
3 Correct 387 ms 120196 KB Output is correct
4 Correct 379 ms 121284 KB Output is correct
5 Correct 318 ms 67420 KB Output is correct
6 Correct 381 ms 130896 KB Output is correct
7 Correct 345 ms 122332 KB Output is correct
8 Correct 374 ms 125208 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 272 ms 57272 KB Output is correct
3 Correct 971 ms 185560 KB Output is correct
4 Correct 979 ms 185252 KB Output is correct
5 Correct 1236 ms 183888 KB Output is correct
6 Correct 446 ms 85952 KB Output is correct
7 Correct 147 ms 44232 KB Output is correct
8 Correct 21 ms 14552 KB Output is correct
9 Correct 1056 ms 188716 KB Output is correct
10 Correct 1555 ms 177760 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 708 ms 178024 KB Output is correct
2 Correct 311 ms 142444 KB Output is correct
3 Correct 718 ms 127888 KB Output is correct
4 Correct 395 ms 145652 KB Output is correct
5 Correct 331 ms 142796 KB Output is correct
6 Incorrect 570 ms 121172 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6488 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 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 5 ms 8284 KB Output is correct
20 Correct 4 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 6 ms 8792 KB Output is correct
23 Correct 11 ms 9560 KB Output is correct
24 Correct 5 ms 8792 KB Output is correct
25 Correct 5 ms 8552 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 8 ms 10076 KB Output is correct
28 Correct 8 ms 10208 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 11196 KB Output is correct
32 Correct 9 ms 11100 KB Output is correct
33 Correct 92 ms 35016 KB Output is correct
34 Correct 106 ms 35152 KB Output is correct
35 Correct 104 ms 35148 KB Output is correct
36 Correct 154 ms 47800 KB Output is correct
37 Correct 156 ms 48216 KB Output is correct
38 Correct 184 ms 50508 KB Output is correct
39 Correct 120 ms 11712 KB Output is correct
40 Correct 111 ms 11496 KB Output is correct
41 Correct 108 ms 11612 KB Output is correct
42 Correct 111 ms 11720 KB Output is correct
43 Correct 104 ms 42128 KB Output is correct
44 Correct 90 ms 41412 KB Output is correct
45 Correct 94 ms 42064 KB Output is correct
46 Correct 98 ms 41756 KB Output is correct
47 Correct 94 ms 40892 KB Output is correct
48 Correct 95 ms 42232 KB Output is correct
49 Correct 88 ms 40800 KB Output is correct
50 Correct 90 ms 41452 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6488 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 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 5 ms 8284 KB Output is correct
20 Correct 4 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 6 ms 8792 KB Output is correct
23 Correct 11 ms 9560 KB Output is correct
24 Correct 5 ms 8792 KB Output is correct
25 Correct 5 ms 8552 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 378 ms 120588 KB Output is correct
28 Correct 393 ms 120764 KB Output is correct
29 Correct 387 ms 120196 KB Output is correct
30 Correct 379 ms 121284 KB Output is correct
31 Correct 318 ms 67420 KB Output is correct
32 Correct 381 ms 130896 KB Output is correct
33 Correct 345 ms 122332 KB Output is correct
34 Correct 374 ms 125208 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 272 ms 57272 KB Output is correct
37 Correct 971 ms 185560 KB Output is correct
38 Correct 979 ms 185252 KB Output is correct
39 Correct 1236 ms 183888 KB Output is correct
40 Correct 446 ms 85952 KB Output is correct
41 Correct 147 ms 44232 KB Output is correct
42 Correct 21 ms 14552 KB Output is correct
43 Correct 1056 ms 188716 KB Output is correct
44 Correct 1555 ms 177760 KB Output is correct
45 Correct 708 ms 178024 KB Output is correct
46 Correct 311 ms 142444 KB Output is correct
47 Correct 718 ms 127888 KB Output is correct
48 Correct 395 ms 145652 KB Output is correct
49 Correct 331 ms 142796 KB Output is correct
50 Incorrect 570 ms 121172 KB Output isn't correct
51 Halted 0 ms 0 KB -