oj.uz

Submission #851264

# Submission time Handle Problem Language Result Execution time Memory
851264 2023-09-19T08:22:31 Z dlalswp25 Circle selection (APIO18_circle_selection) C++17
87 / 100
 3000 ms 231256 KB 
#include <bits/stdc++.h>

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

const int INF = 2020202020;
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;
}

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;
}

void chk(int cand) {
	if (intersect(cur, cand)) {
		int &t = ans[cur];
		if (pii(R[cand], -cand) > pii(R[t], -t)) 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) {
		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);
			it++;
		}
		it = tmp;
		for (int i = 0; i < K; i++) {
			if (it == T[idx].s.begin()) break;
			it--;
			chk(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) {
		p += base; p--;
		while (p >= 1) {
			chk_node(p, y);
			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]);
		seg.get(XR[i], Y[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 1 ms 6488 KB Output is correct
5 Correct 1 ms 6488 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 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 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 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 4 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 7 ms 8616 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 370 ms 112704 KB Output is correct
2 Correct 377 ms 113076 KB Output is correct
3 Correct 380 ms 111940 KB Output is correct
4 Correct 348 ms 111820 KB Output is correct
5 Correct 320 ms 64536 KB Output is correct
6 Correct 388 ms 122332 KB Output is correct
7 Correct 372 ms 114568 KB Output is correct
8 Correct 396 ms 117940 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 266 ms 55436 KB Output is correct
3 Correct 1064 ms 177908 KB Output is correct
4 Correct 1048 ms 176808 KB Output is correct
5 Correct 1472 ms 175820 KB Output is correct
6 Correct 554 ms 81924 KB Output is correct
7 Correct 126 ms 42180 KB Output is correct
8 Correct 15 ms 14036 KB Output is correct
9 Correct 1221 ms 181548 KB Output is correct
10 Correct 1959 ms 170520 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 695 ms 168556 KB Output is correct
2 Correct 301 ms 132892 KB Output is correct
3 Correct 741 ms 119732 KB Output is correct
4 Correct 353 ms 137380 KB Output is correct
5 Correct 324 ms 135092 KB Output is correct
6 Correct 598 ms 112788 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 1 ms 6488 KB Output is correct
5 Correct 1 ms 6488 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 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 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 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 4 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 7 ms 8616 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 8 ms 9816 KB Output is correct
28 Correct 8 ms 9820 KB Output is correct
29 Correct 8 ms 9816 KB Output is correct
30 Correct 13 ms 11608 KB Output is correct
31 Correct 10 ms 10732 KB Output is correct
32 Correct 10 ms 10840 KB Output is correct
33 Correct 87 ms 32964 KB Output is correct
34 Correct 90 ms 32964 KB Output is correct
35 Correct 98 ms 32964 KB Output is correct
36 Correct 139 ms 45764 KB Output is correct
37 Correct 143 ms 46276 KB Output is correct
38 Correct 185 ms 48324 KB Output is correct
39 Correct 124 ms 11592 KB Output is correct
40 Correct 125 ms 11460 KB Output is correct
41 Correct 122 ms 11452 KB Output is correct
42 Correct 137 ms 11900 KB Output is correct
43 Correct 91 ms 39880 KB Output is correct
44 Correct 92 ms 39364 KB Output is correct
45 Correct 97 ms 39876 KB Output is correct
46 Correct 92 ms 39876 KB Output is correct
47 Correct 94 ms 38972 KB Output is correct
48 Correct 90 ms 39916 KB Output is correct
49 Correct 87 ms 38596 KB Output is correct
50 Correct 96 ms 39500 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 1 ms 6488 KB Output is correct
5 Correct 1 ms 6488 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 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 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 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 4 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 7 ms 8616 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 370 ms 112704 KB Output is correct
28 Correct 377 ms 113076 KB Output is correct
29 Correct 380 ms 111940 KB Output is correct
30 Correct 348 ms 111820 KB Output is correct
31 Correct 320 ms 64536 KB Output is correct
32 Correct 388 ms 122332 KB Output is correct
33 Correct 372 ms 114568 KB Output is correct
34 Correct 396 ms 117940 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 266 ms 55436 KB Output is correct
37 Correct 1064 ms 177908 KB Output is correct
38 Correct 1048 ms 176808 KB Output is correct
39 Correct 1472 ms 175820 KB Output is correct
40 Correct 554 ms 81924 KB Output is correct
41 Correct 126 ms 42180 KB Output is correct
42 Correct 15 ms 14036 KB Output is correct
43 Correct 1221 ms 181548 KB Output is correct
44 Correct 1959 ms 170520 KB Output is correct
45 Correct 695 ms 168556 KB Output is correct
46 Correct 301 ms 132892 KB Output is correct
47 Correct 741 ms 119732 KB Output is correct
48 Correct 353 ms 137380 KB Output is correct
49 Correct 324 ms 135092 KB Output is correct
50 Correct 598 ms 112788 KB Output is correct
51 Correct 8 ms 9816 KB Output is correct
52 Correct 8 ms 9820 KB Output is correct
53 Correct 8 ms 9816 KB Output is correct
54 Correct 13 ms 11608 KB Output is correct
55 Correct 10 ms 10732 KB Output is correct
56 Correct 10 ms 10840 KB Output is correct
57 Correct 87 ms 32964 KB Output is correct
58 Correct 90 ms 32964 KB Output is correct
59 Correct 98 ms 32964 KB Output is correct
60 Correct 139 ms 45764 KB Output is correct
61 Correct 143 ms 46276 KB Output is correct
62 Correct 185 ms 48324 KB Output is correct
63 Correct 124 ms 11592 KB Output is correct
64 Correct 125 ms 11460 KB Output is correct
65 Correct 122 ms 11452 KB Output is correct
66 Correct 137 ms 11900 KB Output is correct
67 Correct 91 ms 39880 KB Output is correct
68 Correct 92 ms 39364 KB Output is correct
69 Correct 97 ms 39876 KB Output is correct
70 Correct 92 ms 39876 KB Output is correct
71 Correct 94 ms 38972 KB Output is correct
72 Correct 90 ms 39916 KB Output is correct
73 Correct 87 ms 38596 KB Output is correct
74 Correct 96 ms 39500 KB Output is correct
75 Correct 379 ms 111624 KB Output is correct
76 Correct 372 ms 112152 KB Output is correct
77 Correct 323 ms 111544 KB Output is correct
78 Correct 367 ms 112820 KB Output is correct
79 Correct 462 ms 113948 KB Output is correct
80 Correct 345 ms 111796 KB Output is correct
81 Correct 941 ms 172756 KB Output is correct
82 Correct 768 ms 163432 KB Output is correct
83 Correct 789 ms 163792 KB Output is correct
84 Correct 1405 ms 187948 KB Output is correct
85 Correct 866 ms 169420 KB Output is correct
86 Correct 738 ms 161580 KB Output is correct
87 Execution timed out 3098 ms 231256 KB Time limit exceeded
88 Halted 0 ms 0 KB -