oj.uz

Submission #855560

# Submission time Handle Problem Language Result Execution time Memory
855560 2023-10-01T12:28:09 Z dlalswp25 Circle selection (APIO18_circle_selection) C++17
34 / 100
 1771 ms 198088 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>

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

const int K = 1;

int N;
int X[303030];
int Y[303030];
int R[303030];
int XL[303030];
int XR[303030];
int XC[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 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 (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);
		}
	}

	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 li) {
		p += base; p--;
		while (p >= 1) {
			if (L[p] <= li) break;
			chk_node(p, y, li);
			p >>= 1;
		}
	}
};

int main() {
	rf(N);
	vector<int> v; v.reserve(3 * N);
	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;
		XC[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], 0);
		seg.get(XC[i], Y[i], XL[i]);
		seg.get(XR[i], Y[i], XC[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:131:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  131 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:131:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  131 |  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 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 6504 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 6492 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 2 ms 7004 KB Output is correct
17 Correct 2 ms 7004 KB Output is correct
18 Correct 2 ms 7004 KB Output is correct
19 Correct 5 ms 8408 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 5 ms 8408 KB Output is correct
22 Correct 7 ms 9048 KB Output is correct
23 Correct 10 ms 9564 KB Output is correct
24 Correct 6 ms 8984 KB Output is correct
25 Correct 6 ms 8792 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 515 ms 122152 KB Output is correct
2 Correct 521 ms 122168 KB Output is correct
3 Correct 528 ms 121940 KB Output is correct
4 Correct 505 ms 122192 KB Output is correct
5 Correct 393 ms 69796 KB Output is correct
6 Correct 441 ms 134960 KB Output is correct
7 Correct 456 ms 125068 KB Output is correct
8 Correct 459 ms 127528 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 345 ms 87508 KB Output is correct
3 Correct 1123 ms 195684 KB Output is correct
4 Correct 1071 ms 195220 KB Output is correct
5 Correct 1384 ms 191024 KB Output is correct
6 Correct 493 ms 89264 KB Output is correct
7 Correct 160 ms 46160 KB Output is correct
8 Correct 19 ms 14940 KB Output is correct
9 Correct 1211 ms 198088 KB Output is correct
10 Correct 1771 ms 184484 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 771 ms 186660 KB Output is correct
2 Correct 388 ms 150044 KB Output is correct
3 Correct 863 ms 129364 KB Output is correct
4 Correct 442 ms 153380 KB Output is correct
5 Correct 409 ms 151832 KB Output is correct
6 Incorrect 735 ms 123216 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 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 6504 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 6492 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 2 ms 7004 KB Output is correct
17 Correct 2 ms 7004 KB Output is correct
18 Correct 2 ms 7004 KB Output is correct
19 Correct 5 ms 8408 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 5 ms 8408 KB Output is correct
22 Correct 7 ms 9048 KB Output is correct
23 Correct 10 ms 9564 KB Output is correct
24 Correct 6 ms 8984 KB Output is correct
25 Correct 6 ms 8792 KB Output is correct
26 Correct 6 ms 8792 KB Output is correct
27 Correct 9 ms 10072 KB Output is correct
28 Correct 10 ms 10076 KB Output is correct
29 Correct 10 ms 10076 KB Output is correct
30 Correct 16 ms 12124 KB Output is correct
31 Correct 12 ms 11356 KB Output is correct
32 Correct 12 ms 11356 KB Output is correct
33 Correct 163 ms 62628 KB Output is correct
34 Correct 149 ms 62548 KB Output is correct
35 Correct 151 ms 62700 KB Output is correct
36 Correct 180 ms 77652 KB Output is correct
37 Correct 182 ms 78160 KB Output is correct
38 Correct 220 ms 80356 KB Output is correct
39 Incorrect 118 ms 12376 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 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 6504 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 6492 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 2 ms 7004 KB Output is correct
17 Correct 2 ms 7004 KB Output is correct
18 Correct 2 ms 7004 KB Output is correct
19 Correct 5 ms 8408 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 5 ms 8408 KB Output is correct
22 Correct 7 ms 9048 KB Output is correct
23 Correct 10 ms 9564 KB Output is correct
24 Correct 6 ms 8984 KB Output is correct
25 Correct 6 ms 8792 KB Output is correct
26 Correct 6 ms 8792 KB Output is correct
27 Correct 515 ms 122152 KB Output is correct
28 Correct 521 ms 122168 KB Output is correct
29 Correct 528 ms 121940 KB Output is correct
30 Correct 505 ms 122192 KB Output is correct
31 Correct 393 ms 69796 KB Output is correct
32 Correct 441 ms 134960 KB Output is correct
33 Correct 456 ms 125068 KB Output is correct
34 Correct 459 ms 127528 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 345 ms 87508 KB Output is correct
37 Correct 1123 ms 195684 KB Output is correct
38 Correct 1071 ms 195220 KB Output is correct
39 Correct 1384 ms 191024 KB Output is correct
40 Correct 493 ms 89264 KB Output is correct
41 Correct 160 ms 46160 KB Output is correct
42 Correct 19 ms 14940 KB Output is correct
43 Correct 1211 ms 198088 KB Output is correct
44 Correct 1771 ms 184484 KB Output is correct
45 Correct 771 ms 186660 KB Output is correct
46 Correct 388 ms 150044 KB Output is correct
47 Correct 863 ms 129364 KB Output is correct
48 Correct 442 ms 153380 KB Output is correct
49 Correct 409 ms 151832 KB Output is correct
50 Incorrect 735 ms 123216 KB Output isn't correct
51 Halted 0 ms 0 KB -