oj.uz

Submission #855743

# Submission time Handle Problem Language Result Execution time Memory
855743 2023-10-01T17:35:51 Z dlalswp25 Circle selection (APIO18_circle_selection) C++17
87 / 100
 3000 ms 245140 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#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;
set<pii>::iterator it, tmp;
int i;

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 &t = ans[cur];
	if (R[it->second] < R[t] || (R[it->second] == R[t] && it->second > t)) return;
	if (intersect(cur, it->second)) t = it->second;
}

set<pii> T[2121212];
int L[2121212];

struct SegTree {
	int n, base;

	void init(int _n) {
		n = _n;
		for (base = 1; base < n; base <<= 1);
		for (i = base; i < base + base; i++) L[i] = i - base + 1;
		for (i = base - 1; i >= 1; i--) L[i] = L[i << 1];
	}

	void chk_node(int idx, int y, int r, int li) {
		it = T[idx].lower_bound({y, 0});
		tmp = it;
		for (i = 0; i < K; i++) {
			if (it == T[idx].end()) break;
			if (XL[it->second] <= li) break;
			chk();
			if (it->first >= (long long)y + r + r) break;
			if (i < K - 1) it++;
		}
		it = tmp;
		for (i = 0; i < K; i++) {
			if (it == T[idx].begin()) break;
			it--;
			if (XL[it->second] <= li) break;
			chk();
			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++].insert(x);
			if (~q & 1) T[q--].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, li);
			p >>= 1;
		}
	}
} seg;

int main() {
	rf(N);
	vector<int> v;
	for (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 (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();
	seg.init(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 (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 (i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:128:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  128 |  for (i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |                                                  ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 107088 KB Output is correct
2 Correct 24 ms 107100 KB Output is correct
3 Correct 22 ms 107048 KB Output is correct
4 Correct 21 ms 107152 KB Output is correct
5 Correct 22 ms 107100 KB Output is correct
6 Correct 22 ms 107100 KB Output is correct
7 Correct 22 ms 107100 KB Output is correct
8 Correct 22 ms 107352 KB Output is correct
9 Correct 22 ms 107140 KB Output is correct
10 Correct 26 ms 107248 KB Output is correct
11 Correct 23 ms 106992 KB Output is correct
12 Correct 22 ms 107100 KB Output is correct
13 Correct 22 ms 107096 KB Output is correct
14 Correct 22 ms 107136 KB Output is correct
15 Correct 22 ms 107096 KB Output is correct
16 Correct 22 ms 107076 KB Output is correct
17 Correct 23 ms 107192 KB Output is correct
18 Correct 23 ms 107096 KB Output is correct
19 Correct 27 ms 107356 KB Output is correct
20 Correct 25 ms 107356 KB Output is correct
21 Correct 26 ms 107356 KB Output is correct
22 Correct 26 ms 107836 KB Output is correct
23 Correct 29 ms 108556 KB Output is correct
24 Correct 27 ms 107868 KB Output is correct
25 Correct 27 ms 107608 KB Output is correct
26 Correct 26 ms 107856 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 395 ms 125880 KB Output is correct
2 Correct 406 ms 125360 KB Output is correct
3 Correct 394 ms 124600 KB Output is correct
4 Correct 382 ms 125620 KB Output is correct
5 Correct 341 ms 123304 KB Output is correct
6 Correct 400 ms 135336 KB Output is correct
7 Correct 380 ms 126504 KB Output is correct
8 Correct 387 ms 129932 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 107040 KB Output is correct
2 Correct 285 ms 135500 KB Output is correct
3 Correct 982 ms 191336 KB Output is correct
4 Correct 965 ms 190456 KB Output is correct
5 Correct 1287 ms 188284 KB Output is correct
6 Correct 424 ms 140348 KB Output is correct
7 Correct 151 ms 122320 KB Output is correct
8 Correct 38 ms 111060 KB Output is correct
9 Correct 1054 ms 194804 KB Output is correct
10 Correct 1540 ms 184268 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 698 ms 183444 KB Output is correct
2 Correct 322 ms 147332 KB Output is correct
3 Correct 716 ms 133864 KB Output is correct
4 Correct 367 ms 151084 KB Output is correct
5 Correct 350 ms 148344 KB Output is correct
6 Correct 608 ms 128536 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 107088 KB Output is correct
2 Correct 24 ms 107100 KB Output is correct
3 Correct 22 ms 107048 KB Output is correct
4 Correct 21 ms 107152 KB Output is correct
5 Correct 22 ms 107100 KB Output is correct
6 Correct 22 ms 107100 KB Output is correct
7 Correct 22 ms 107100 KB Output is correct
8 Correct 22 ms 107352 KB Output is correct
9 Correct 22 ms 107140 KB Output is correct
10 Correct 26 ms 107248 KB Output is correct
11 Correct 23 ms 106992 KB Output is correct
12 Correct 22 ms 107100 KB Output is correct
13 Correct 22 ms 107096 KB Output is correct
14 Correct 22 ms 107136 KB Output is correct
15 Correct 22 ms 107096 KB Output is correct
16 Correct 22 ms 107076 KB Output is correct
17 Correct 23 ms 107192 KB Output is correct
18 Correct 23 ms 107096 KB Output is correct
19 Correct 27 ms 107356 KB Output is correct
20 Correct 25 ms 107356 KB Output is correct
21 Correct 26 ms 107356 KB Output is correct
22 Correct 26 ms 107836 KB Output is correct
23 Correct 29 ms 108556 KB Output is correct
24 Correct 27 ms 107868 KB Output is correct
25 Correct 27 ms 107608 KB Output is correct
26 Correct 26 ms 107856 KB Output is correct
27 Correct 30 ms 109916 KB Output is correct
28 Correct 30 ms 109864 KB Output is correct
29 Correct 31 ms 109908 KB Output is correct
30 Correct 35 ms 111612 KB Output is correct
31 Correct 31 ms 110684 KB Output is correct
32 Correct 32 ms 110900 KB Output is correct
33 Correct 117 ms 113488 KB Output is correct
34 Correct 119 ms 113524 KB Output is correct
35 Correct 124 ms 113236 KB Output is correct
36 Correct 167 ms 125912 KB Output is correct
37 Correct 170 ms 126364 KB Output is correct
38 Correct 184 ms 128516 KB Output is correct
39 Correct 135 ms 113096 KB Output is correct
40 Correct 140 ms 113160 KB Output is correct
41 Correct 134 ms 113092 KB Output is correct
42 Correct 142 ms 113720 KB Output is correct
43 Correct 118 ms 120120 KB Output is correct
44 Correct 110 ms 119456 KB Output is correct
45 Correct 113 ms 120096 KB Output is correct
46 Correct 112 ms 119976 KB Output is correct
47 Correct 111 ms 119232 KB Output is correct
48 Correct 113 ms 120008 KB Output is correct
49 Correct 107 ms 118732 KB Output is correct
50 Correct 112 ms 119492 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 107088 KB Output is correct
2 Correct 24 ms 107100 KB Output is correct
3 Correct 22 ms 107048 KB Output is correct
4 Correct 21 ms 107152 KB Output is correct
5 Correct 22 ms 107100 KB Output is correct
6 Correct 22 ms 107100 KB Output is correct
7 Correct 22 ms 107100 KB Output is correct
8 Correct 22 ms 107352 KB Output is correct
9 Correct 22 ms 107140 KB Output is correct
10 Correct 26 ms 107248 KB Output is correct
11 Correct 23 ms 106992 KB Output is correct
12 Correct 22 ms 107100 KB Output is correct
13 Correct 22 ms 107096 KB Output is correct
14 Correct 22 ms 107136 KB Output is correct
15 Correct 22 ms 107096 KB Output is correct
16 Correct 22 ms 107076 KB Output is correct
17 Correct 23 ms 107192 KB Output is correct
18 Correct 23 ms 107096 KB Output is correct
19 Correct 27 ms 107356 KB Output is correct
20 Correct 25 ms 107356 KB Output is correct
21 Correct 26 ms 107356 KB Output is correct
22 Correct 26 ms 107836 KB Output is correct
23 Correct 29 ms 108556 KB Output is correct
24 Correct 27 ms 107868 KB Output is correct
25 Correct 27 ms 107608 KB Output is correct
26 Correct 26 ms 107856 KB Output is correct
27 Correct 395 ms 125880 KB Output is correct
28 Correct 406 ms 125360 KB Output is correct
29 Correct 394 ms 124600 KB Output is correct
30 Correct 382 ms 125620 KB Output is correct
31 Correct 341 ms 123304 KB Output is correct
32 Correct 400 ms 135336 KB Output is correct
33 Correct 380 ms 126504 KB Output is correct
34 Correct 387 ms 129932 KB Output is correct
35 Correct 22 ms 107040 KB Output is correct
36 Correct 285 ms 135500 KB Output is correct
37 Correct 982 ms 191336 KB Output is correct
38 Correct 965 ms 190456 KB Output is correct
39 Correct 1287 ms 188284 KB Output is correct
40 Correct 424 ms 140348 KB Output is correct
41 Correct 151 ms 122320 KB Output is correct
42 Correct 38 ms 111060 KB Output is correct
43 Correct 1054 ms 194804 KB Output is correct
44 Correct 1540 ms 184268 KB Output is correct
45 Correct 698 ms 183444 KB Output is correct
46 Correct 322 ms 147332 KB Output is correct
47 Correct 716 ms 133864 KB Output is correct
48 Correct 367 ms 151084 KB Output is correct
49 Correct 350 ms 148344 KB Output is correct
50 Correct 608 ms 128536 KB Output is correct
51 Correct 30 ms 109916 KB Output is correct
52 Correct 30 ms 109864 KB Output is correct
53 Correct 31 ms 109908 KB Output is correct
54 Correct 35 ms 111612 KB Output is correct
55 Correct 31 ms 110684 KB Output is correct
56 Correct 32 ms 110900 KB Output is correct
57 Correct 117 ms 113488 KB Output is correct
58 Correct 119 ms 113524 KB Output is correct
59 Correct 124 ms 113236 KB Output is correct
60 Correct 167 ms 125912 KB Output is correct
61 Correct 170 ms 126364 KB Output is correct
62 Correct 184 ms 128516 KB Output is correct
63 Correct 135 ms 113096 KB Output is correct
64 Correct 140 ms 113160 KB Output is correct
65 Correct 134 ms 113092 KB Output is correct
66 Correct 142 ms 113720 KB Output is correct
67 Correct 118 ms 120120 KB Output is correct
68 Correct 110 ms 119456 KB Output is correct
69 Correct 113 ms 120096 KB Output is correct
70 Correct 112 ms 119976 KB Output is correct
71 Correct 111 ms 119232 KB Output is correct
72 Correct 113 ms 120008 KB Output is correct
73 Correct 107 ms 118732 KB Output is correct
74 Correct 112 ms 119492 KB Output is correct
75 Correct 416 ms 126936 KB Output is correct
76 Correct 415 ms 125364 KB Output is correct
77 Correct 358 ms 126648 KB Output is correct
78 Correct 384 ms 125712 KB Output is correct
79 Correct 476 ms 126152 KB Output is correct
80 Correct 384 ms 124920 KB Output is correct
81 Correct 858 ms 185588 KB Output is correct
82 Correct 725 ms 178172 KB Output is correct
83 Correct 740 ms 177108 KB Output is correct
84 Correct 1165 ms 202360 KB Output is correct
85 Correct 814 ms 183732 KB Output is correct
86 Correct 686 ms 174520 KB Output is correct
87 Correct 2647 ms 245140 KB Output is correct
88 Correct 418 ms 125812 KB Output is correct
89 Correct 421 ms 125468 KB Output is correct
90 Correct 416 ms 126360 KB Output is correct
91 Correct 472 ms 127064 KB Output is correct
92 Correct 445 ms 125468 KB Output is correct
93 Correct 375 ms 146524 KB Output is correct
94 Correct 2794 ms 196032 KB Output is correct
95 Correct 361 ms 146208 KB Output is correct
96 Correct 369 ms 147380 KB Output is correct
97 Correct 2075 ms 171120 KB Output is correct
98 Correct 430 ms 138616 KB Output is correct
99 Correct 362 ms 145592 KB Output is correct
100 Correct 333 ms 146148 KB Output is correct
101 Correct 530 ms 149408 KB Output is correct
102 Correct 378 ms 146144 KB Output is correct
103 Execution timed out 3018 ms 185636 KB Time limit exceeded
104 Halted 0 ms 0 KB -