oj.uz

답안 #851529

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
851529 2023-09-20T04:20:03 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 238800 KB 
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#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:128:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  128 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:128:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  128 |  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 6692 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 6488 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 2 ms 6488 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 1 ms 6744 KB Output is correct
18 Correct 1 ms 6744 KB Output is correct
19 Correct 5 ms 8280 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 5 ms 8280 KB Output is correct
22 Correct 5 ms 8792 KB Output is correct
23 Correct 9 ms 9560 KB Output is correct
24 Correct 5 ms 8792 KB Output is correct
25 Correct 5 ms 8536 KB Output is correct
26 Correct 5 ms 8792 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 407 ms 121112 KB Output is correct
2 Correct 375 ms 120520 KB Output is correct
3 Correct 375 ms 120500 KB Output is correct
4 Correct 369 ms 121036 KB Output is correct
5 Correct 307 ms 67572 KB Output is correct
6 Correct 384 ms 130480 KB Output is correct
7 Correct 360 ms 123828 KB Output is correct
8 Correct 354 ms 124848 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 259 ms 57308 KB Output is correct
3 Correct 985 ms 185724 KB Output is correct
4 Correct 945 ms 185012 KB Output is correct
5 Correct 1227 ms 184716 KB Output is correct
6 Correct 425 ms 85848 KB Output is correct
7 Correct 150 ms 44484 KB Output is correct
8 Correct 15 ms 14548 KB Output is correct
9 Correct 1082 ms 188620 KB Output is correct
10 Correct 1640 ms 178528 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 685 ms 177828 KB Output is correct
2 Correct 316 ms 140924 KB Output is correct
3 Correct 675 ms 127368 KB Output is correct
4 Correct 390 ms 145852 KB Output is correct
5 Correct 327 ms 142256 KB Output is correct
6 Correct 581 ms 121296 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 6692 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 6488 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 2 ms 6488 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 1 ms 6744 KB Output is correct
18 Correct 1 ms 6744 KB Output is correct
19 Correct 5 ms 8280 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 5 ms 8280 KB Output is correct
22 Correct 5 ms 8792 KB Output is correct
23 Correct 9 ms 9560 KB Output is correct
24 Correct 5 ms 8792 KB Output is correct
25 Correct 5 ms 8536 KB Output is correct
26 Correct 5 ms 8792 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 10072 KB Output is correct
30 Correct 14 ms 11864 KB Output is correct
31 Correct 10 ms 11100 KB Output is correct
32 Correct 9 ms 11096 KB Output is correct
33 Correct 95 ms 35644 KB Output is correct
34 Correct 94 ms 35148 KB Output is correct
35 Correct 103 ms 35008 KB Output is correct
36 Correct 137 ms 47808 KB Output is correct
37 Correct 143 ms 48324 KB Output is correct
38 Correct 185 ms 50728 KB Output is correct
39 Correct 115 ms 11536 KB Output is correct
40 Correct 114 ms 11576 KB Output is correct
41 Correct 111 ms 11516 KB Output is correct
42 Correct 120 ms 11716 KB Output is correct
43 Correct 97 ms 41920 KB Output is correct
44 Correct 91 ms 41300 KB Output is correct
45 Correct 93 ms 41924 KB Output is correct
46 Correct 97 ms 41804 KB Output is correct
47 Correct 91 ms 41032 KB Output is correct
48 Correct 92 ms 41920 KB Output is correct
49 Correct 91 ms 40644 KB Output is correct
50 Correct 92 ms 41412 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6692 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 6488 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 2 ms 6488 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 1 ms 6744 KB Output is correct
18 Correct 1 ms 6744 KB Output is correct
19 Correct 5 ms 8280 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 5 ms 8280 KB Output is correct
22 Correct 5 ms 8792 KB Output is correct
23 Correct 9 ms 9560 KB Output is correct
24 Correct 5 ms 8792 KB Output is correct
25 Correct 5 ms 8536 KB Output is correct
26 Correct 5 ms 8792 KB Output is correct
27 Correct 407 ms 121112 KB Output is correct
28 Correct 375 ms 120520 KB Output is correct
29 Correct 375 ms 120500 KB Output is correct
30 Correct 369 ms 121036 KB Output is correct
31 Correct 307 ms 67572 KB Output is correct
32 Correct 384 ms 130480 KB Output is correct
33 Correct 360 ms 123828 KB Output is correct
34 Correct 354 ms 124848 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 259 ms 57308 KB Output is correct
37 Correct 985 ms 185724 KB Output is correct
38 Correct 945 ms 185012 KB Output is correct
39 Correct 1227 ms 184716 KB Output is correct
40 Correct 425 ms 85848 KB Output is correct
41 Correct 150 ms 44484 KB Output is correct
42 Correct 15 ms 14548 KB Output is correct
43 Correct 1082 ms 188620 KB Output is correct
44 Correct 1640 ms 178528 KB Output is correct
45 Correct 685 ms 177828 KB Output is correct
46 Correct 316 ms 140924 KB Output is correct
47 Correct 675 ms 127368 KB Output is correct
48 Correct 390 ms 145852 KB Output is correct
49 Correct 327 ms 142256 KB Output is correct
50 Correct 581 ms 121296 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 10072 KB Output is correct
54 Correct 14 ms 11864 KB Output is correct
55 Correct 10 ms 11100 KB Output is correct
56 Correct 9 ms 11096 KB Output is correct
57 Correct 95 ms 35644 KB Output is correct
58 Correct 94 ms 35148 KB Output is correct
59 Correct 103 ms 35008 KB Output is correct
60 Correct 137 ms 47808 KB Output is correct
61 Correct 143 ms 48324 KB Output is correct
62 Correct 185 ms 50728 KB Output is correct
63 Correct 115 ms 11536 KB Output is correct
64 Correct 114 ms 11576 KB Output is correct
65 Correct 111 ms 11516 KB Output is correct
66 Correct 120 ms 11716 KB Output is correct
67 Correct 97 ms 41920 KB Output is correct
68 Correct 91 ms 41300 KB Output is correct
69 Correct 93 ms 41924 KB Output is correct
70 Correct 97 ms 41804 KB Output is correct
71 Correct 91 ms 41032 KB Output is correct
72 Correct 92 ms 41920 KB Output is correct
73 Correct 91 ms 40644 KB Output is correct
74 Correct 92 ms 41412 KB Output is correct
75 Correct 413 ms 120200 KB Output is correct
76 Correct 375 ms 121428 KB Output is correct
77 Correct 336 ms 120076 KB Output is correct
78 Correct 364 ms 121064 KB Output is correct
79 Correct 443 ms 120832 KB Output is correct
80 Correct 365 ms 120000 KB Output is correct
81 Correct 939 ms 181260 KB Output is correct
82 Correct 717 ms 172212 KB Output is correct
83 Correct 725 ms 172276 KB Output is correct
84 Correct 1175 ms 196072 KB Output is correct
85 Correct 847 ms 178352 KB Output is correct
86 Correct 682 ms 169396 KB Output is correct
87 Correct 2670 ms 238800 KB Output is correct
88 Correct 386 ms 21940 KB Output is correct
89 Correct 395 ms 22884 KB Output is correct
90 Correct 395 ms 22068 KB Output is correct
91 Correct 386 ms 23216 KB Output is correct
92 Correct 387 ms 22452 KB Output is correct
93 Correct 348 ms 141236 KB Output is correct
94 Correct 2984 ms 91284 KB Output is correct
95 Correct 353 ms 141092 KB Output is correct
96 Correct 357 ms 143028 KB Output is correct
97 Correct 2191 ms 65704 KB Output is correct
98 Correct 392 ms 133300 KB Output is correct
99 Correct 357 ms 140724 KB Output is correct
100 Correct 326 ms 141232 KB Output is correct
101 Correct 518 ms 145076 KB Output is correct
102 Correct 359 ms 141772 KB Output is correct
103 Execution timed out 3028 ms 86376 KB Time limit exceeded
104 Halted 0 ms 0 KB -