oj.uz

Submission #851528

# Submission time Handle Problem Language Result Execution time Memory
851528 2023-09-20T04:17:24 Z dlalswp25 Circle selection (APIO18_circle_selection) C++17
87 / 100
 3000 ms 239864 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;
	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);
	scanf("%d", &N);
	vector<int> v;
	for (int i = 1; i <= N; i++) {
		// rf(X[i]); rf(Y[i]); rf(R[i]);
		scanf("%d%d%d", &X[i], &Y[i], &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("");
      |                                                      ^~~~
circle_selection.cpp:95:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
circle_selection.cpp:99:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |   scanf("%d%d%d", &X[i], &Y[i], &R[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 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 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 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 6 ms 8796 KB Output is correct
23 Correct 10 ms 9560 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 7 ms 8540 KB Output is correct
26 Correct 7 ms 8796 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 464 ms 119752 KB Output is correct
2 Correct 435 ms 121532 KB Output is correct
3 Correct 429 ms 120420 KB Output is correct
4 Correct 412 ms 121280 KB Output is correct
5 Correct 392 ms 68496 KB Output is correct
6 Correct 426 ms 132396 KB Output is correct
7 Correct 411 ms 123064 KB Output is correct
8 Correct 419 ms 126136 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 300 ms 57388 KB Output is correct
3 Correct 1071 ms 185600 KB Output is correct
4 Correct 1052 ms 185364 KB Output is correct
5 Correct 1326 ms 183972 KB Output is correct
6 Correct 490 ms 86000 KB Output is correct
7 Correct 160 ms 44376 KB Output is correct
8 Correct 18 ms 14552 KB Output is correct
9 Correct 1164 ms 188024 KB Output is correct
10 Correct 1680 ms 178812 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 767 ms 176712 KB Output is correct
2 Correct 356 ms 140980 KB Output is correct
3 Correct 759 ms 128184 KB Output is correct
4 Correct 416 ms 144748 KB Output is correct
5 Correct 434 ms 142272 KB Output is correct
6 Correct 671 ms 121272 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 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 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 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 6 ms 8796 KB Output is correct
23 Correct 10 ms 9560 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 7 ms 8540 KB Output is correct
26 Correct 7 ms 8796 KB Output is correct
27 Correct 9 ms 10076 KB Output is correct
28 Correct 9 ms 10204 KB Output is correct
29 Correct 9 ms 10072 KB Output is correct
30 Correct 16 ms 11776 KB Output is correct
31 Correct 13 ms 11096 KB Output is correct
32 Correct 12 ms 11100 KB Output is correct
33 Correct 115 ms 35160 KB Output is correct
34 Correct 122 ms 35096 KB Output is correct
35 Correct 119 ms 35192 KB Output is correct
36 Correct 158 ms 47816 KB Output is correct
37 Correct 167 ms 48272 KB Output is correct
38 Correct 190 ms 50444 KB Output is correct
39 Correct 125 ms 11464 KB Output is correct
40 Correct 132 ms 11464 KB Output is correct
41 Correct 131 ms 11492 KB Output is correct
42 Correct 130 ms 11820 KB Output is correct
43 Correct 109 ms 42076 KB Output is correct
44 Correct 104 ms 41412 KB Output is correct
45 Correct 117 ms 42004 KB Output is correct
46 Correct 121 ms 41856 KB Output is correct
47 Correct 107 ms 40900 KB Output is correct
48 Correct 106 ms 41924 KB Output is correct
49 Correct 111 ms 40832 KB Output is correct
50 Correct 113 ms 41416 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 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 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 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 6 ms 8796 KB Output is correct
23 Correct 10 ms 9560 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 7 ms 8540 KB Output is correct
26 Correct 7 ms 8796 KB Output is correct
27 Correct 464 ms 119752 KB Output is correct
28 Correct 435 ms 121532 KB Output is correct
29 Correct 429 ms 120420 KB Output is correct
30 Correct 412 ms 121280 KB Output is correct
31 Correct 392 ms 68496 KB Output is correct
32 Correct 426 ms 132396 KB Output is correct
33 Correct 411 ms 123064 KB Output is correct
34 Correct 419 ms 126136 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 300 ms 57388 KB Output is correct
37 Correct 1071 ms 185600 KB Output is correct
38 Correct 1052 ms 185364 KB Output is correct
39 Correct 1326 ms 183972 KB Output is correct
40 Correct 490 ms 86000 KB Output is correct
41 Correct 160 ms 44376 KB Output is correct
42 Correct 18 ms 14552 KB Output is correct
43 Correct 1164 ms 188024 KB Output is correct
44 Correct 1680 ms 178812 KB Output is correct
45 Correct 767 ms 176712 KB Output is correct
46 Correct 356 ms 140980 KB Output is correct
47 Correct 759 ms 128184 KB Output is correct
48 Correct 416 ms 144748 KB Output is correct
49 Correct 434 ms 142272 KB Output is correct
50 Correct 671 ms 121272 KB Output is correct
51 Correct 9 ms 10076 KB Output is correct
52 Correct 9 ms 10204 KB Output is correct
53 Correct 9 ms 10072 KB Output is correct
54 Correct 16 ms 11776 KB Output is correct
55 Correct 13 ms 11096 KB Output is correct
56 Correct 12 ms 11100 KB Output is correct
57 Correct 115 ms 35160 KB Output is correct
58 Correct 122 ms 35096 KB Output is correct
59 Correct 119 ms 35192 KB Output is correct
60 Correct 158 ms 47816 KB Output is correct
61 Correct 167 ms 48272 KB Output is correct
62 Correct 190 ms 50444 KB Output is correct
63 Correct 125 ms 11464 KB Output is correct
64 Correct 132 ms 11464 KB Output is correct
65 Correct 131 ms 11492 KB Output is correct
66 Correct 130 ms 11820 KB Output is correct
67 Correct 109 ms 42076 KB Output is correct
68 Correct 104 ms 41412 KB Output is correct
69 Correct 117 ms 42004 KB Output is correct
70 Correct 121 ms 41856 KB Output is correct
71 Correct 107 ms 40900 KB Output is correct
72 Correct 106 ms 41924 KB Output is correct
73 Correct 111 ms 40832 KB Output is correct
74 Correct 113 ms 41416 KB Output is correct
75 Correct 435 ms 121276 KB Output is correct
76 Correct 437 ms 119800 KB Output is correct
77 Correct 403 ms 121064 KB Output is correct
78 Correct 428 ms 120504 KB Output is correct
79 Correct 507 ms 121260 KB Output is correct
80 Correct 427 ms 119744 KB Output is correct
81 Correct 944 ms 180860 KB Output is correct
82 Correct 838 ms 171660 KB Output is correct
83 Correct 786 ms 172036 KB Output is correct
84 Correct 1288 ms 195552 KB Output is correct
85 Correct 858 ms 177400 KB Output is correct
86 Correct 773 ms 170944 KB Output is correct
87 Correct 2784 ms 239864 KB Output is correct
88 Correct 431 ms 22932 KB Output is correct
89 Correct 466 ms 22712 KB Output is correct
90 Correct 426 ms 22004 KB Output is correct
91 Correct 436 ms 23384 KB Output is correct
92 Correct 448 ms 22440 KB Output is correct
93 Correct 401 ms 141492 KB Output is correct
94 Execution timed out 3049 ms 90184 KB Time limit exceeded
95 Halted 0 ms 0 KB -