oj.uz

Submission #851448

# Submission time Handle Problem Language Result Execution time Memory
851448 2023-09-19T19:30:43 Z dlalswp25 Circle selection (APIO18_circle_selection) C++17
87 / 100
 3000 ms 230924 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;
 
	SegTree(int _n) : n(_n) {
		for (base = 1; base < n; base <<= 1);
		T.resize(base + base);
	}
 
	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) {
		p += base; p--;
		while (p >= 1) {
			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]);
		seg.get(XR[i], Y[i], R[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:121:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  121 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:121:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  121 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |                                                      ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory 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 2 ms 6488 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 1 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 2 ms 6744 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 4 ms 8284 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 5 ms 8280 KB Output is correct
22 Correct 6 ms 8792 KB Output is correct
23 Correct 9 ms 9304 KB Output is correct
24 Correct 5 ms 8536 KB Output is correct
25 Correct 5 ms 8280 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 352 ms 111544 KB Output is correct
2 Correct 372 ms 113128 KB Output is correct
3 Correct 376 ms 111440 KB Output is correct
4 Correct 366 ms 111908 KB Output is correct
5 Correct 305 ms 64692 KB Output is correct
6 Correct 379 ms 122488 KB Output is correct
7 Correct 349 ms 114388 KB Output is correct
8 Correct 376 ms 117364 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 245 ms 55212 KB Output is correct
3 Correct 924 ms 177844 KB Output is correct
4 Correct 905 ms 176684 KB Output is correct
5 Correct 1181 ms 176004 KB Output is correct
6 Correct 467 ms 82048 KB Output is correct
7 Correct 133 ms 42296 KB Output is correct
8 Correct 16 ms 14068 KB Output is correct
9 Correct 1026 ms 181660 KB Output is correct
10 Correct 1579 ms 170104 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 704 ms 168960 KB Output is correct
2 Correct 306 ms 132788 KB Output is correct
3 Correct 664 ms 119892 KB Output is correct
4 Correct 364 ms 136620 KB Output is correct
5 Correct 338 ms 135416 KB Output is correct
6 Correct 599 ms 113288 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory 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 2 ms 6488 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 1 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 2 ms 6744 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 4 ms 8284 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 5 ms 8280 KB Output is correct
22 Correct 6 ms 8792 KB Output is correct
23 Correct 9 ms 9304 KB Output is correct
24 Correct 5 ms 8536 KB Output is correct
25 Correct 5 ms 8280 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 9 ms 9816 KB Output is correct
28 Correct 8 ms 9816 KB Output is correct
29 Correct 8 ms 9816 KB Output is correct
30 Correct 15 ms 11608 KB Output is correct
31 Correct 9 ms 10840 KB Output is correct
32 Correct 10 ms 10840 KB Output is correct
33 Correct 94 ms 32964 KB Output is correct
34 Correct 95 ms 33072 KB Output is correct
35 Correct 98 ms 32960 KB Output is correct
36 Correct 157 ms 46148 KB Output is correct
37 Correct 140 ms 46280 KB Output is correct
38 Correct 162 ms 48324 KB Output is correct
39 Correct 114 ms 11456 KB Output is correct
40 Correct 114 ms 11460 KB Output is correct
41 Correct 117 ms 11604 KB Output is correct
42 Correct 119 ms 11716 KB Output is correct
43 Correct 93 ms 40080 KB Output is correct
44 Correct 99 ms 39244 KB Output is correct
45 Correct 97 ms 39876 KB Output is correct
46 Correct 97 ms 39880 KB Output is correct
47 Correct 90 ms 38996 KB Output is correct
48 Correct 94 ms 39876 KB Output is correct
49 Correct 93 ms 38596 KB Output is correct
50 Correct 91 ms 39420 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory 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 2 ms 6488 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 1 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 2 ms 6744 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 4 ms 8284 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 5 ms 8280 KB Output is correct
22 Correct 6 ms 8792 KB Output is correct
23 Correct 9 ms 9304 KB Output is correct
24 Correct 5 ms 8536 KB Output is correct
25 Correct 5 ms 8280 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 352 ms 111544 KB Output is correct
28 Correct 372 ms 113128 KB Output is correct
29 Correct 376 ms 111440 KB Output is correct
30 Correct 366 ms 111908 KB Output is correct
31 Correct 305 ms 64692 KB Output is correct
32 Correct 379 ms 122488 KB Output is correct
33 Correct 349 ms 114388 KB Output is correct
34 Correct 376 ms 117364 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 245 ms 55212 KB Output is correct
37 Correct 924 ms 177844 KB Output is correct
38 Correct 905 ms 176684 KB Output is correct
39 Correct 1181 ms 176004 KB Output is correct
40 Correct 467 ms 82048 KB Output is correct
41 Correct 133 ms 42296 KB Output is correct
42 Correct 16 ms 14068 KB Output is correct
43 Correct 1026 ms 181660 KB Output is correct
44 Correct 1579 ms 170104 KB Output is correct
45 Correct 704 ms 168960 KB Output is correct
46 Correct 306 ms 132788 KB Output is correct
47 Correct 664 ms 119892 KB Output is correct
48 Correct 364 ms 136620 KB Output is correct
49 Correct 338 ms 135416 KB Output is correct
50 Correct 599 ms 113288 KB Output is correct
51 Correct 9 ms 9816 KB Output is correct
52 Correct 8 ms 9816 KB Output is correct
53 Correct 8 ms 9816 KB Output is correct
54 Correct 15 ms 11608 KB Output is correct
55 Correct 9 ms 10840 KB Output is correct
56 Correct 10 ms 10840 KB Output is correct
57 Correct 94 ms 32964 KB Output is correct
58 Correct 95 ms 33072 KB Output is correct
59 Correct 98 ms 32960 KB Output is correct
60 Correct 157 ms 46148 KB Output is correct
61 Correct 140 ms 46280 KB Output is correct
62 Correct 162 ms 48324 KB Output is correct
63 Correct 114 ms 11456 KB Output is correct
64 Correct 114 ms 11460 KB Output is correct
65 Correct 117 ms 11604 KB Output is correct
66 Correct 119 ms 11716 KB Output is correct
67 Correct 93 ms 40080 KB Output is correct
68 Correct 99 ms 39244 KB Output is correct
69 Correct 97 ms 39876 KB Output is correct
70 Correct 97 ms 39880 KB Output is correct
71 Correct 90 ms 38996 KB Output is correct
72 Correct 94 ms 39876 KB Output is correct
73 Correct 93 ms 38596 KB Output is correct
74 Correct 91 ms 39420 KB Output is correct
75 Correct 381 ms 111540 KB Output is correct
76 Correct 378 ms 113280 KB Output is correct
77 Correct 348 ms 112224 KB Output is correct
78 Correct 347 ms 112660 KB Output is correct
79 Correct 450 ms 112524 KB Output is correct
80 Correct 360 ms 112824 KB Output is correct
81 Correct 880 ms 172016 KB Output is correct
82 Correct 685 ms 164796 KB Output is correct
83 Correct 696 ms 163764 KB Output is correct
84 Correct 1146 ms 187424 KB Output is correct
85 Correct 801 ms 169652 KB Output is correct
86 Correct 668 ms 162228 KB Output is correct
87 Correct 2599 ms 230924 KB Output is correct
88 Correct 414 ms 22196 KB Output is correct
89 Correct 426 ms 23456 KB Output is correct
90 Correct 456 ms 23440 KB Output is correct
91 Correct 509 ms 22664 KB Output is correct
92 Correct 454 ms 22128 KB Output is correct
93 Correct 347 ms 133556 KB Output is correct
94 Execution timed out 3033 ms 90140 KB Time limit exceeded
95 Halted 0 ms 0 KB -