oj.uz

답안 #852337

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852337 2023-09-21T15:53:35 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 239496 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 y, int r, 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 (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 y, int r, int li) {
		p += base; p--;
		while (p >= 1) {
			if (L[p] <= li) break;
			chk_node(p, y, 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], 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:130:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  130 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:130:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  130 |  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 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 6488 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 1 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 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 9624 KB Output is correct
24 Correct 5 ms 8756 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 6 ms 8644 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 362 ms 119844 KB Output is correct
2 Correct 380 ms 120916 KB Output is correct
3 Correct 380 ms 119720 KB Output is correct
4 Correct 385 ms 121016 KB Output is correct
5 Correct 292 ms 68868 KB Output is correct
6 Correct 354 ms 131256 KB Output is correct
7 Correct 352 ms 122296 KB Output is correct
8 Correct 364 ms 126208 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 271 ms 57576 KB Output is correct
3 Correct 964 ms 187052 KB Output is correct
4 Correct 914 ms 186548 KB Output is correct
5 Correct 1239 ms 184396 KB Output is correct
6 Correct 433 ms 85916 KB Output is correct
7 Correct 131 ms 44240 KB Output is correct
8 Correct 15 ms 14552 KB Output is correct
9 Correct 1041 ms 188260 KB Output is correct
10 Correct 1536 ms 177804 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 714 ms 176476 KB Output is correct
2 Correct 304 ms 141388 KB Output is correct
3 Correct 668 ms 126996 KB Output is correct
4 Correct 351 ms 144624 KB Output is correct
5 Correct 324 ms 142516 KB Output is correct
6 Correct 583 ms 121784 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 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 6488 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 1 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 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 9624 KB Output is correct
24 Correct 5 ms 8756 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 6 ms 8644 KB Output is correct
27 Correct 8 ms 10152 KB Output is correct
28 Correct 8 ms 10148 KB Output is correct
29 Correct 8 ms 10076 KB Output is correct
30 Correct 12 ms 11900 KB Output is correct
31 Correct 9 ms 11100 KB Output is correct
32 Correct 11 ms 11100 KB Output is correct
33 Correct 91 ms 35172 KB Output is correct
34 Correct 122 ms 35012 KB Output is correct
35 Correct 101 ms 35016 KB Output is correct
36 Correct 145 ms 47840 KB Output is correct
37 Correct 147 ms 48320 KB Output is correct
38 Correct 161 ms 50328 KB Output is correct
39 Correct 120 ms 11360 KB Output is correct
40 Correct 125 ms 11516 KB Output is correct
41 Correct 112 ms 11464 KB Output is correct
42 Correct 119 ms 11756 KB Output is correct
43 Correct 93 ms 42140 KB Output is correct
44 Correct 102 ms 41388 KB Output is correct
45 Correct 106 ms 42008 KB Output is correct
46 Correct 93 ms 41924 KB Output is correct
47 Correct 90 ms 40904 KB Output is correct
48 Correct 96 ms 41948 KB Output is correct
49 Correct 89 ms 40640 KB Output is correct
50 Correct 94 ms 41340 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 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 6488 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 1 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 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 9624 KB Output is correct
24 Correct 5 ms 8756 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 6 ms 8644 KB Output is correct
27 Correct 362 ms 119844 KB Output is correct
28 Correct 380 ms 120916 KB Output is correct
29 Correct 380 ms 119720 KB Output is correct
30 Correct 385 ms 121016 KB Output is correct
31 Correct 292 ms 68868 KB Output is correct
32 Correct 354 ms 131256 KB Output is correct
33 Correct 352 ms 122296 KB Output is correct
34 Correct 364 ms 126208 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 271 ms 57576 KB Output is correct
37 Correct 964 ms 187052 KB Output is correct
38 Correct 914 ms 186548 KB Output is correct
39 Correct 1239 ms 184396 KB Output is correct
40 Correct 433 ms 85916 KB Output is correct
41 Correct 131 ms 44240 KB Output is correct
42 Correct 15 ms 14552 KB Output is correct
43 Correct 1041 ms 188260 KB Output is correct
44 Correct 1536 ms 177804 KB Output is correct
45 Correct 714 ms 176476 KB Output is correct
46 Correct 304 ms 141388 KB Output is correct
47 Correct 668 ms 126996 KB Output is correct
48 Correct 351 ms 144624 KB Output is correct
49 Correct 324 ms 142516 KB Output is correct
50 Correct 583 ms 121784 KB Output is correct
51 Correct 8 ms 10152 KB Output is correct
52 Correct 8 ms 10148 KB Output is correct
53 Correct 8 ms 10076 KB Output is correct
54 Correct 12 ms 11900 KB Output is correct
55 Correct 9 ms 11100 KB Output is correct
56 Correct 11 ms 11100 KB Output is correct
57 Correct 91 ms 35172 KB Output is correct
58 Correct 122 ms 35012 KB Output is correct
59 Correct 101 ms 35016 KB Output is correct
60 Correct 145 ms 47840 KB Output is correct
61 Correct 147 ms 48320 KB Output is correct
62 Correct 161 ms 50328 KB Output is correct
63 Correct 120 ms 11360 KB Output is correct
64 Correct 125 ms 11516 KB Output is correct
65 Correct 112 ms 11464 KB Output is correct
66 Correct 119 ms 11756 KB Output is correct
67 Correct 93 ms 42140 KB Output is correct
68 Correct 102 ms 41388 KB Output is correct
69 Correct 106 ms 42008 KB Output is correct
70 Correct 93 ms 41924 KB Output is correct
71 Correct 90 ms 40904 KB Output is correct
72 Correct 96 ms 41948 KB Output is correct
73 Correct 89 ms 40640 KB Output is correct
74 Correct 94 ms 41340 KB Output is correct
75 Correct 385 ms 119872 KB Output is correct
76 Correct 392 ms 121024 KB Output is correct
77 Correct 348 ms 121400 KB Output is correct
78 Correct 378 ms 119936 KB Output is correct
79 Correct 459 ms 120788 KB Output is correct
80 Correct 389 ms 120884 KB Output is correct
81 Correct 891 ms 181700 KB Output is correct
82 Correct 738 ms 172988 KB Output is correct
83 Correct 695 ms 172220 KB Output is correct
84 Correct 1164 ms 195608 KB Output is correct
85 Correct 785 ms 178636 KB Output is correct
86 Correct 673 ms 169880 KB Output is correct
87 Correct 2574 ms 239496 KB Output is correct
88 Correct 416 ms 21952 KB Output is correct
89 Correct 400 ms 22028 KB Output is correct
90 Correct 390 ms 23480 KB Output is correct
91 Correct 411 ms 22452 KB Output is correct
92 Correct 383 ms 22964 KB Output is correct
93 Correct 342 ms 143200 KB Output is correct
94 Correct 2845 ms 90416 KB Output is correct
95 Correct 339 ms 142776 KB Output is correct
96 Correct 344 ms 142260 KB Output is correct
97 Correct 2139 ms 66272 KB Output is correct
98 Correct 378 ms 132792 KB Output is correct
99 Correct 340 ms 140724 KB Output is correct
100 Correct 323 ms 142260 KB Output is correct
101 Correct 484 ms 144308 KB Output is correct
102 Correct 344 ms 142520 KB Output is correct
103 Execution timed out 3029 ms 84248 KB Time limit exceeded
104 Halted 0 ms 0 KB -