oj.uz

Submission #851457

# Submission time Handle Problem Language Result Execution time Memory
851457 2023-09-19T20:11:10 Z dlalswp25 Circle selection (APIO18_circle_selection) C++17
87 / 100
 3000 ms 240984 KB 
#include <bits/stdc++.h>

using namespace std;
typedef pair<int, int> pii;

int N;
int X[303030];
int Y[303030];
int R[303030];
int XL[303030];
int XR[303030];
int XM[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 dir) {
		auto it = T[idx].s.lower_bound({y, 0});
		if ((dir & 1) && it != T[idx].s.end()) chk(it->second);
		if ((dir & 2) && it != T[idx].s.begin()) chk(prev(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 dir) {
		p += base; p--;
		while (p >= 1) {
			chk_node(p, y, dir);
			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]);
		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;
		XM[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], 3);
		seg.get(XR[i], Y[i], 3);
		seg.get(XM[i], Y[i] + R[i], 1);
		seg.get(XM[i], Y[i] - R[i], 2);
		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:112:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  112 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:112:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  112 |  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 2 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6744 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 2 ms 6488 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 6488 KB Output is correct
13 Correct 2 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 7000 KB Output is correct
17 Correct 2 ms 7000 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 8280 KB Output is correct
21 Correct 6 ms 8280 KB Output is correct
22 Correct 7 ms 8792 KB Output is correct
23 Correct 12 ms 9560 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 6 ms 8544 KB Output is correct
26 Correct 6 ms 8792 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 516 ms 113968 KB Output is correct
2 Correct 511 ms 114356 KB Output is correct
3 Correct 522 ms 113700 KB Output is correct
4 Correct 507 ms 113956 KB Output is correct
5 Correct 430 ms 66196 KB Output is correct
6 Correct 520 ms 126760 KB Output is correct
7 Correct 515 ms 117176 KB Output is correct
8 Correct 522 ms 119648 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 313 ms 83392 KB Output is correct
3 Correct 1186 ms 187504 KB Output is correct
4 Correct 1146 ms 186848 KB Output is correct
5 Correct 1463 ms 182672 KB Output is correct
6 Correct 566 ms 85252 KB Output is correct
7 Correct 175 ms 43972 KB Output is correct
8 Correct 20 ms 14552 KB Output is correct
9 Correct 1262 ms 189860 KB Output is correct
10 Correct 1930 ms 176252 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 825 ms 178636 KB Output is correct
2 Correct 405 ms 142112 KB Output is correct
3 Correct 926 ms 121896 KB Output is correct
4 Correct 446 ms 145332 KB Output is correct
5 Correct 427 ms 143428 KB Output is correct
6 Correct 772 ms 115328 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 2 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6744 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 2 ms 6488 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 6488 KB Output is correct
13 Correct 2 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 7000 KB Output is correct
17 Correct 2 ms 7000 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 8280 KB Output is correct
21 Correct 6 ms 8280 KB Output is correct
22 Correct 7 ms 8792 KB Output is correct
23 Correct 12 ms 9560 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 6 ms 8544 KB Output is correct
26 Correct 6 ms 8792 KB Output is correct
27 Correct 11 ms 10072 KB Output is correct
28 Correct 10 ms 10072 KB Output is correct
29 Correct 10 ms 10024 KB Output is correct
30 Correct 15 ms 11864 KB Output is correct
31 Correct 12 ms 11100 KB Output is correct
32 Correct 12 ms 11096 KB Output is correct
33 Correct 143 ms 58464 KB Output is correct
34 Correct 152 ms 58460 KB Output is correct
35 Correct 147 ms 58576 KB Output is correct
36 Correct 198 ms 73660 KB Output is correct
37 Correct 214 ms 74256 KB Output is correct
38 Correct 218 ms 76388 KB Output is correct
39 Correct 155 ms 12432 KB Output is correct
40 Correct 144 ms 12280 KB Output is correct
41 Correct 144 ms 12220 KB Output is correct
42 Correct 138 ms 12732 KB Output is correct
43 Correct 136 ms 67164 KB Output is correct
44 Correct 127 ms 67260 KB Output is correct
45 Correct 127 ms 67260 KB Output is correct
46 Correct 135 ms 67312 KB Output is correct
47 Correct 129 ms 67264 KB Output is correct
48 Correct 129 ms 67156 KB Output is correct
49 Correct 127 ms 67168 KB Output is correct
50 Correct 130 ms 67260 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 2 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6744 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 2 ms 6488 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 6488 KB Output is correct
13 Correct 2 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 7000 KB Output is correct
17 Correct 2 ms 7000 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 8280 KB Output is correct
21 Correct 6 ms 8280 KB Output is correct
22 Correct 7 ms 8792 KB Output is correct
23 Correct 12 ms 9560 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 6 ms 8544 KB Output is correct
26 Correct 6 ms 8792 KB Output is correct
27 Correct 516 ms 113968 KB Output is correct
28 Correct 511 ms 114356 KB Output is correct
29 Correct 522 ms 113700 KB Output is correct
30 Correct 507 ms 113956 KB Output is correct
31 Correct 430 ms 66196 KB Output is correct
32 Correct 520 ms 126760 KB Output is correct
33 Correct 515 ms 117176 KB Output is correct
34 Correct 522 ms 119648 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 313 ms 83392 KB Output is correct
37 Correct 1186 ms 187504 KB Output is correct
38 Correct 1146 ms 186848 KB Output is correct
39 Correct 1463 ms 182672 KB Output is correct
40 Correct 566 ms 85252 KB Output is correct
41 Correct 175 ms 43972 KB Output is correct
42 Correct 20 ms 14552 KB Output is correct
43 Correct 1262 ms 189860 KB Output is correct
44 Correct 1930 ms 176252 KB Output is correct
45 Correct 825 ms 178636 KB Output is correct
46 Correct 405 ms 142112 KB Output is correct
47 Correct 926 ms 121896 KB Output is correct
48 Correct 446 ms 145332 KB Output is correct
49 Correct 427 ms 143428 KB Output is correct
50 Correct 772 ms 115328 KB Output is correct
51 Correct 11 ms 10072 KB Output is correct
52 Correct 10 ms 10072 KB Output is correct
53 Correct 10 ms 10024 KB Output is correct
54 Correct 15 ms 11864 KB Output is correct
55 Correct 12 ms 11100 KB Output is correct
56 Correct 12 ms 11096 KB Output is correct
57 Correct 143 ms 58464 KB Output is correct
58 Correct 152 ms 58460 KB Output is correct
59 Correct 147 ms 58576 KB Output is correct
60 Correct 198 ms 73660 KB Output is correct
61 Correct 214 ms 74256 KB Output is correct
62 Correct 218 ms 76388 KB Output is correct
63 Correct 155 ms 12432 KB Output is correct
64 Correct 144 ms 12280 KB Output is correct
65 Correct 144 ms 12220 KB Output is correct
66 Correct 138 ms 12732 KB Output is correct
67 Correct 136 ms 67164 KB Output is correct
68 Correct 127 ms 67260 KB Output is correct
69 Correct 127 ms 67260 KB Output is correct
70 Correct 135 ms 67312 KB Output is correct
71 Correct 129 ms 67264 KB Output is correct
72 Correct 129 ms 67156 KB Output is correct
73 Correct 127 ms 67168 KB Output is correct
74 Correct 130 ms 67260 KB Output is correct
75 Correct 520 ms 113564 KB Output is correct
76 Correct 519 ms 113960 KB Output is correct
77 Correct 504 ms 113820 KB Output is correct
78 Correct 539 ms 113816 KB Output is correct
79 Correct 638 ms 114308 KB Output is correct
80 Correct 516 ms 113912 KB Output is correct
81 Correct 1070 ms 182448 KB Output is correct
82 Correct 939 ms 173248 KB Output is correct
83 Correct 912 ms 173588 KB Output is correct
84 Correct 1413 ms 197824 KB Output is correct
85 Correct 1010 ms 179124 KB Output is correct
86 Correct 885 ms 171292 KB Output is correct
87 Execution timed out 3023 ms 240984 KB Time limit exceeded
88 Halted 0 ms 0 KB -