oj.uz

답안 #855559

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
855559 2023-10-01T12:27:06 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 244152 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 XC[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 y, int li) {
		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;
			if (XL[it->second] <= li) break;
			chk(it->second);
			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);
		}
	}

	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 li) {
		p += base; p--;
		while (p >= 1) {
			if (L[p] <= li) break;
			chk_node(p, y, li);
			p >>= 1;
		}
	}
};

int main() {
	rf(N);
	vector<int> v; v.reserve(3 * N);
	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]);
		v.push_back(X[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;
		XC[i] = lower_bound(v.begin(), v.end(), X[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], 0);
		seg.get(XC[i], Y[i], XL[i]);
		seg.get(XR[i], Y[i], XC[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:131:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  131 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:131:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  131 |  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 6488 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 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 7004 KB Output is correct
17 Correct 2 ms 6860 KB Output is correct
18 Correct 2 ms 7004 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 6 ms 8284 KB Output is correct
22 Correct 7 ms 9048 KB Output is correct
23 Correct 12 ms 9564 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 6 ms 8724 KB Output is correct
26 Correct 7 ms 8792 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 553 ms 122164 KB Output is correct
2 Correct 555 ms 122144 KB Output is correct
3 Correct 534 ms 121940 KB Output is correct
4 Correct 531 ms 122168 KB Output is correct
5 Correct 404 ms 69716 KB Output is correct
6 Correct 468 ms 134944 KB Output is correct
7 Correct 494 ms 125080 KB Output is correct
8 Correct 469 ms 127512 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 336 ms 87356 KB Output is correct
3 Correct 1214 ms 195840 KB Output is correct
4 Correct 1167 ms 195104 KB Output is correct
5 Correct 1620 ms 190988 KB Output is correct
6 Correct 556 ms 89328 KB Output is correct
7 Correct 180 ms 46164 KB Output is correct
8 Correct 19 ms 15024 KB Output is correct
9 Correct 1340 ms 197980 KB Output is correct
10 Correct 2160 ms 184664 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 847 ms 186592 KB Output is correct
2 Correct 398 ms 150044 KB Output is correct
3 Correct 1069 ms 129424 KB Output is correct
4 Correct 434 ms 153460 KB Output is correct
5 Correct 414 ms 151636 KB Output is correct
6 Correct 901 ms 123212 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 6488 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 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 7004 KB Output is correct
17 Correct 2 ms 6860 KB Output is correct
18 Correct 2 ms 7004 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 6 ms 8284 KB Output is correct
22 Correct 7 ms 9048 KB Output is correct
23 Correct 12 ms 9564 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 6 ms 8724 KB Output is correct
26 Correct 7 ms 8792 KB Output is correct
27 Correct 10 ms 10076 KB Output is correct
28 Correct 10 ms 10076 KB Output is correct
29 Correct 10 ms 10076 KB Output is correct
30 Correct 18 ms 12080 KB Output is correct
31 Correct 12 ms 11352 KB Output is correct
32 Correct 12 ms 11352 KB Output is correct
33 Correct 141 ms 62436 KB Output is correct
34 Correct 147 ms 62432 KB Output is correct
35 Correct 154 ms 62540 KB Output is correct
36 Correct 188 ms 77788 KB Output is correct
37 Correct 219 ms 78112 KB Output is correct
38 Correct 215 ms 80356 KB Output is correct
39 Correct 142 ms 12372 KB Output is correct
40 Correct 144 ms 12368 KB Output is correct
41 Correct 140 ms 12284 KB Output is correct
42 Correct 150 ms 12784 KB Output is correct
43 Correct 126 ms 71212 KB Output is correct
44 Correct 128 ms 71252 KB Output is correct
45 Correct 124 ms 71252 KB Output is correct
46 Correct 124 ms 71248 KB Output is correct
47 Correct 125 ms 71248 KB Output is correct
48 Correct 127 ms 71252 KB Output is correct
49 Correct 127 ms 71248 KB Output is correct
50 Correct 126 ms 71588 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 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 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 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 7004 KB Output is correct
17 Correct 2 ms 6860 KB Output is correct
18 Correct 2 ms 7004 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 6 ms 8284 KB Output is correct
22 Correct 7 ms 9048 KB Output is correct
23 Correct 12 ms 9564 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 6 ms 8724 KB Output is correct
26 Correct 7 ms 8792 KB Output is correct
27 Correct 553 ms 122164 KB Output is correct
28 Correct 555 ms 122144 KB Output is correct
29 Correct 534 ms 121940 KB Output is correct
30 Correct 531 ms 122168 KB Output is correct
31 Correct 404 ms 69716 KB Output is correct
32 Correct 468 ms 134944 KB Output is correct
33 Correct 494 ms 125080 KB Output is correct
34 Correct 469 ms 127512 KB Output is correct
35 Correct 1 ms 6744 KB Output is correct
36 Correct 336 ms 87356 KB Output is correct
37 Correct 1214 ms 195840 KB Output is correct
38 Correct 1167 ms 195104 KB Output is correct
39 Correct 1620 ms 190988 KB Output is correct
40 Correct 556 ms 89328 KB Output is correct
41 Correct 180 ms 46164 KB Output is correct
42 Correct 19 ms 15024 KB Output is correct
43 Correct 1340 ms 197980 KB Output is correct
44 Correct 2160 ms 184664 KB Output is correct
45 Correct 847 ms 186592 KB Output is correct
46 Correct 398 ms 150044 KB Output is correct
47 Correct 1069 ms 129424 KB Output is correct
48 Correct 434 ms 153460 KB Output is correct
49 Correct 414 ms 151636 KB Output is correct
50 Correct 901 ms 123212 KB Output is correct
51 Correct 10 ms 10076 KB Output is correct
52 Correct 10 ms 10076 KB Output is correct
53 Correct 10 ms 10076 KB Output is correct
54 Correct 18 ms 12080 KB Output is correct
55 Correct 12 ms 11352 KB Output is correct
56 Correct 12 ms 11352 KB Output is correct
57 Correct 141 ms 62436 KB Output is correct
58 Correct 147 ms 62432 KB Output is correct
59 Correct 154 ms 62540 KB Output is correct
60 Correct 188 ms 77788 KB Output is correct
61 Correct 219 ms 78112 KB Output is correct
62 Correct 215 ms 80356 KB Output is correct
63 Correct 142 ms 12372 KB Output is correct
64 Correct 144 ms 12368 KB Output is correct
65 Correct 140 ms 12284 KB Output is correct
66 Correct 150 ms 12784 KB Output is correct
67 Correct 126 ms 71212 KB Output is correct
68 Correct 128 ms 71252 KB Output is correct
69 Correct 124 ms 71252 KB Output is correct
70 Correct 124 ms 71248 KB Output is correct
71 Correct 125 ms 71248 KB Output is correct
72 Correct 127 ms 71252 KB Output is correct
73 Correct 127 ms 71248 KB Output is correct
74 Correct 126 ms 71588 KB Output is correct
75 Correct 548 ms 131016 KB Output is correct
76 Correct 548 ms 130876 KB Output is correct
77 Correct 541 ms 130852 KB Output is correct
78 Correct 549 ms 130864 KB Output is correct
79 Correct 652 ms 131156 KB Output is correct
80 Correct 535 ms 130644 KB Output is correct
81 Correct 1125 ms 198624 KB Output is correct
82 Correct 977 ms 189352 KB Output is correct
83 Correct 924 ms 189220 KB Output is correct
84 Correct 1507 ms 214412 KB Output is correct
85 Correct 1067 ms 195256 KB Output is correct
86 Correct 849 ms 187300 KB Output is correct
87 Execution timed out 3040 ms 244152 KB Time limit exceeded
88 Halted 0 ms 0 KB -