oj.uz

답안 #854755

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
854755 2023-09-28T18:10:16 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 240248 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#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) {
		int y = Y[cur];
		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 (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--;
			if (XL[it->second] <= li) break;
			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 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: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 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 6744 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 1 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6604 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 4 ms 8284 KB Output is correct
21 Correct 4 ms 8284 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 9 ms 9564 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 367 ms 121528 KB Output is correct
2 Correct 360 ms 119736 KB Output is correct
3 Correct 360 ms 120752 KB Output is correct
4 Correct 359 ms 120800 KB Output is correct
5 Correct 301 ms 68276 KB Output is correct
6 Correct 364 ms 131952 KB Output is correct
7 Correct 351 ms 123884 KB Output is correct
8 Correct 359 ms 125392 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 231 ms 57448 KB Output is correct
3 Correct 934 ms 185788 KB Output is correct
4 Correct 939 ms 184972 KB Output is correct
5 Correct 1187 ms 184516 KB Output is correct
6 Correct 395 ms 85808 KB Output is correct
7 Correct 126 ms 44244 KB Output is correct
8 Correct 16 ms 14548 KB Output is correct
9 Correct 1051 ms 189108 KB Output is correct
10 Correct 1543 ms 179388 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 686 ms 177592 KB Output is correct
2 Correct 307 ms 140924 KB Output is correct
3 Correct 647 ms 126900 KB Output is correct
4 Correct 354 ms 145196 KB Output is correct
5 Correct 342 ms 142652 KB Output is correct
6 Correct 573 ms 122296 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 6744 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 1 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6604 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 4 ms 8284 KB Output is correct
21 Correct 4 ms 8284 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 9 ms 9564 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 8 ms 10072 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 11084 KB Output is correct
32 Correct 10 ms 11100 KB Output is correct
33 Correct 90 ms 35016 KB Output is correct
34 Correct 101 ms 35268 KB Output is correct
35 Correct 101 ms 35124 KB Output is correct
36 Correct 139 ms 47696 KB Output is correct
37 Correct 141 ms 48228 KB Output is correct
38 Correct 158 ms 50512 KB Output is correct
39 Correct 110 ms 11464 KB Output is correct
40 Correct 110 ms 11460 KB Output is correct
41 Correct 109 ms 11456 KB Output is correct
42 Correct 116 ms 11716 KB Output is correct
43 Correct 92 ms 41920 KB Output is correct
44 Correct 90 ms 41408 KB Output is correct
45 Correct 103 ms 42436 KB Output is correct
46 Correct 92 ms 41972 KB Output is correct
47 Correct 89 ms 41360 KB Output is correct
48 Correct 92 ms 41932 KB Output is correct
49 Correct 89 ms 40536 KB Output is correct
50 Correct 91 ms 41416 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 6744 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 1 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6604 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 4 ms 8284 KB Output is correct
21 Correct 4 ms 8284 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 9 ms 9564 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 367 ms 121528 KB Output is correct
28 Correct 360 ms 119736 KB Output is correct
29 Correct 360 ms 120752 KB Output is correct
30 Correct 359 ms 120800 KB Output is correct
31 Correct 301 ms 68276 KB Output is correct
32 Correct 364 ms 131952 KB Output is correct
33 Correct 351 ms 123884 KB Output is correct
34 Correct 359 ms 125392 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 231 ms 57448 KB Output is correct
37 Correct 934 ms 185788 KB Output is correct
38 Correct 939 ms 184972 KB Output is correct
39 Correct 1187 ms 184516 KB Output is correct
40 Correct 395 ms 85808 KB Output is correct
41 Correct 126 ms 44244 KB Output is correct
42 Correct 16 ms 14548 KB Output is correct
43 Correct 1051 ms 189108 KB Output is correct
44 Correct 1543 ms 179388 KB Output is correct
45 Correct 686 ms 177592 KB Output is correct
46 Correct 307 ms 140924 KB Output is correct
47 Correct 647 ms 126900 KB Output is correct
48 Correct 354 ms 145196 KB Output is correct
49 Correct 342 ms 142652 KB Output is correct
50 Correct 573 ms 122296 KB Output is correct
51 Correct 8 ms 10072 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 11084 KB Output is correct
56 Correct 10 ms 11100 KB Output is correct
57 Correct 90 ms 35016 KB Output is correct
58 Correct 101 ms 35268 KB Output is correct
59 Correct 101 ms 35124 KB Output is correct
60 Correct 139 ms 47696 KB Output is correct
61 Correct 141 ms 48228 KB Output is correct
62 Correct 158 ms 50512 KB Output is correct
63 Correct 110 ms 11464 KB Output is correct
64 Correct 110 ms 11460 KB Output is correct
65 Correct 109 ms 11456 KB Output is correct
66 Correct 116 ms 11716 KB Output is correct
67 Correct 92 ms 41920 KB Output is correct
68 Correct 90 ms 41408 KB Output is correct
69 Correct 103 ms 42436 KB Output is correct
70 Correct 92 ms 41972 KB Output is correct
71 Correct 89 ms 41360 KB Output is correct
72 Correct 92 ms 41932 KB Output is correct
73 Correct 89 ms 40536 KB Output is correct
74 Correct 91 ms 41416 KB Output is correct
75 Correct 371 ms 120500 KB Output is correct
76 Correct 373 ms 120792 KB Output is correct
77 Correct 336 ms 121012 KB Output is correct
78 Correct 351 ms 121148 KB Output is correct
79 Correct 445 ms 121784 KB Output is correct
80 Correct 377 ms 121280 KB Output is correct
81 Correct 827 ms 180928 KB Output is correct
82 Correct 692 ms 172980 KB Output is correct
83 Correct 717 ms 172228 KB Output is correct
84 Correct 1168 ms 195848 KB Output is correct
85 Correct 786 ms 177248 KB Output is correct
86 Correct 669 ms 170932 KB Output is correct
87 Correct 2578 ms 240248 KB Output is correct
88 Correct 380 ms 23472 KB Output is correct
89 Correct 387 ms 22632 KB Output is correct
90 Correct 404 ms 21944 KB Output is correct
91 Correct 381 ms 22020 KB Output is correct
92 Correct 392 ms 22196 KB Output is correct
93 Correct 353 ms 142480 KB Output is correct
94 Correct 2903 ms 90612 KB Output is correct
95 Correct 345 ms 142428 KB Output is correct
96 Correct 373 ms 142776 KB Output is correct
97 Correct 2141 ms 66540 KB Output is correct
98 Correct 391 ms 134112 KB Output is correct
99 Correct 342 ms 142264 KB Output is correct
100 Correct 322 ms 142960 KB Output is correct
101 Correct 497 ms 145084 KB Output is correct
102 Correct 349 ms 142520 KB Output is correct
103 Execution timed out 3061 ms 85368 KB Time limit exceeded
104 Halted 0 ms 0 KB -