oj.uz

Submission #854734

# Submission time Handle Problem Language Result Execution time Memory
854734 2023-09-28T16:33:42 Z dlalswp25 Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 780760 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 = 3;

int N;
int X[303030];
int Y[303030];
int R[303030];
int XL[303030];
int XR[303030];
pii UL[303030][22];
pii UR[303030][22];
int V[303030][44];
int ulp[303030];
int urp[303030];
int vp[303030];
int ans[303030];
char rr;

struct DSU {
	int n;
	vector<int> l, r, c;
	vector<bool> chk;
	int cid;

	DSU(int _n = 0) : n(_n), l(_n + 1), r(_n + 1), c(_n), chk(_n), cid(0) {
		l[0] = -1; r[0] = n;
	}

	inline int left(int x) {
		x = min(x, n - 1);
		return x < 0 ? -1 : (chk[x] ? x : l[c[x]]);
	}
	inline int right(int x) {
		x = max(x, 0);
		return x >= n ? n : (chk[x] ? x : r[c[x]]);
	}

	void upd(int x) {
		int lb = left(x), rb = right(x);
		chk[x] = true;
		cid++;
		if (x - lb <= rb - x) {
			for (int i = lb + 1; i < x; i++) c[i] = cid;
			l[cid] = lb; r[cid] = x;
			if (x < n - 1 && !chk[x + 1]) l[c[x + 1]] = x;
		} else {
			for (int i = x + 1; i < rb; i++) c[i] = cid;
			l[cid] = x; r[cid] = rb;
			if (x && !chk[x - 1]) r[c[x - 1]] = x;
		}
	}
};

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) {
	int dx = X[i] - X[j], dy = Y[i] - Y[j], r = R[i] + R[j];
	return (long long)dx * dx + (long long)dy * dy <= (long long)r * r;
}

inline void upd_ans(int cur, int cand) {
	int &t = ans[cur];
	if (R[t] > R[cand] || (R[t] == R[cand] && t < cand)) return;
	if (intersect(cur, cand)) t = cand;
}

struct SegTree {
	struct Node {
		vector<pii> v;
		DSU uf;
	};

	int n, base;
	vector<Node> T;

	SegTree(int _n) : n(_n) {
		for (base = 1; base < n; base <<= 1);
		T.resize(base + base);
	}

	void add_line(int p, int q, int y, int i) {
		p += base; q += base;
		p--; q--;
		while (p <= q) {
			if (p & 1) {
				V[i][vp[i]++] = T[p].v.size();
				T[p].v.emplace_back(y, i);
				p++;
			}
			if (~q & 1) {
				V[i][vp[i]++] = T[q].v.size();
				T[q].v.emplace_back(y, i);
				q--;
			}
			p >>= 1; q >>= 1;
		}
	}

	void add_point(int p, int i, bool is_left) {
		p += base; p--;
		while (p) {
			if (is_left) UL[i][ulp[i]++] = {p, (int)T[p].v.size()};
			else UR[i][urp[i]++] = {p, (int)T[p].v.size()};
			p >>= 1;
		}
	}

	void init() {
		for (int i = 1; i < base + base; i++) T[i].uf = DSU(T[i].v.size());
	}

	void upd(int p, int q, int i) {
		p += base; q += base;
		p--; q--;
		int ptr = 0;
		while (p <= q) {
			if (p & 1) {
				T[p].uf.upd(V[i][ptr++]);
				p++;
			}
			if (~q & 1) {
				T[q].uf.upd(V[i][ptr++]);
				q--;
			}
			p >>= 1; q >>= 1;
		}
	}

	void chk(int cur, bool is_left) {
		if (is_left) {
			for (int i = 0; i < ulp[cur]; i++) {
				int p, s; tie(p, s) = UL[cur][i];
				int t = s;
				for (int j = 0; j < K; j++) {
					t = T[p].uf.right(t);
					if (t >= T[p].v.size()) break;
					upd_ans(cur, T[p].v[t].second);
					t++;
				}
				t = s;
				for (int j = 0; j < K; j++) {
					t = T[p].uf.left(t);
					if (t < 0) break;
					upd_ans(cur, T[p].v[t].second);
					t--;
				}
			}
		} else {
			for (int i = 0; i < urp[cur]; i++) {
				int p, s; tie(p, s) = UR[cur][i];
				int t = s;
				for (int j = 0; j < K; j++) {
					t = T[p].uf.right(t);
					if (t >= T[p].v.size()) break;
					upd_ans(cur, T[p].v[t].second);
					t++;
				}
				t = s;
				for (int j = 0; j < K; j++) {
					t = T[p].uf.left(t);
					if (t < 0) break;
					upd_ans(cur, T[p].v[t].second);
					t--;
				}
			}
		}
	}
};

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> ord(N);
	iota(ord.begin(), ord.end(), 1);

	sort(ord.begin(), ord.end(), [&](int a, int b) { return Y[a] < Y[b]; });
	for (int i : ord) {
		seg.add_line(XL[i], XR[i], Y[i], i);
		seg.add_point(XL[i], i, true);
		seg.add_point(XR[i], i, false);
	}
	seg.init();

	sort(ord.begin(), ord.end(), [&](int a, int b) {
		if (R[a] == R[b]) return a < b;
		return R[a] > R[b];
	});
	for (int i : ord) {
		ans[i] = i;
		seg.chk(i, true);
		seg.chk(i, false);
		if (ans[i] == i) seg.upd(XL[i], XR[i], i);
	}

	for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
	return 0;
}

Compilation message

circle_selection.cpp: In member function 'void SegTree::chk(int, bool)':
circle_selection.cpp:149:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  149 |      if (t >= T[p].v.size()) break;
      |          ~~^~~~~~~~~~~~~~~~
circle_selection.cpp:167:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  167 |      if (t >= T[p].v.size()) break;
      |          ~~^~~~~~~~~~~~~~~~
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:224:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  224 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:224:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  224 |  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 2 ms 12636 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12888 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 4 ms 13916 KB Output is correct
17 Correct 4 ms 13892 KB Output is correct
18 Correct 4 ms 13912 KB Output is correct
19 Correct 16 ms 23644 KB Output is correct
20 Correct 21 ms 23644 KB Output is correct
21 Correct 17 ms 23536 KB Output is correct
22 Correct 15 ms 22620 KB Output is correct
23 Correct 20 ms 23132 KB Output is correct
24 Correct 15 ms 22528 KB Output is correct
25 Correct 13 ms 22364 KB Output is correct
26 Correct 14 ms 22616 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2194 ms 771064 KB Output is correct
2 Correct 2323 ms 772652 KB Output is correct
3 Correct 2311 ms 772424 KB Output is correct
4 Correct 2214 ms 769120 KB Output is correct
5 Correct 1425 ms 454476 KB Output is correct
6 Correct 1313 ms 674200 KB Output is correct
7 Correct 1660 ms 690876 KB Output is correct
8 Correct 1529 ms 686424 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 589 ms 204624 KB Output is correct
3 Correct 2110 ms 695444 KB Output is correct
4 Correct 2074 ms 696512 KB Output is correct
5 Correct 2463 ms 704116 KB Output is correct
6 Correct 1137 ms 364736 KB Output is correct
7 Correct 456 ms 190660 KB Output is correct
8 Correct 64 ms 52116 KB Output is correct
9 Correct 2183 ms 700344 KB Output is correct
10 Correct 2929 ms 715696 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1705 ms 691044 KB Output is correct
2 Correct 1069 ms 659104 KB Output is correct
3 Correct 2882 ms 743768 KB Output is correct
4 Correct 1160 ms 663764 KB Output is correct
5 Correct 1120 ms 659840 KB Output is correct
6 Correct 2830 ms 758192 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12888 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 4 ms 13916 KB Output is correct
17 Correct 4 ms 13892 KB Output is correct
18 Correct 4 ms 13912 KB Output is correct
19 Correct 16 ms 23644 KB Output is correct
20 Correct 21 ms 23644 KB Output is correct
21 Correct 17 ms 23536 KB Output is correct
22 Correct 15 ms 22620 KB Output is correct
23 Correct 20 ms 23132 KB Output is correct
24 Correct 15 ms 22528 KB Output is correct
25 Correct 13 ms 22364 KB Output is correct
26 Correct 14 ms 22616 KB Output is correct
27 Correct 35 ms 34908 KB Output is correct
28 Correct 36 ms 34956 KB Output is correct
29 Correct 41 ms 34904 KB Output is correct
30 Correct 47 ms 33372 KB Output is correct
31 Correct 29 ms 32848 KB Output is correct
32 Correct 30 ms 32604 KB Output is correct
33 Correct 518 ms 223820 KB Output is correct
34 Correct 621 ms 224884 KB Output is correct
35 Correct 625 ms 226400 KB Output is correct
36 Correct 432 ms 198856 KB Output is correct
37 Correct 444 ms 199256 KB Output is correct
38 Correct 471 ms 201160 KB Output is correct
39 Correct 167 ms 72384 KB Output is correct
40 Correct 166 ms 72472 KB Output is correct
41 Correct 159 ms 72388 KB Output is correct
42 Correct 190 ms 76228 KB Output is correct
43 Correct 295 ms 193228 KB Output is correct
44 Correct 274 ms 191900 KB Output is correct
45 Correct 278 ms 192968 KB Output is correct
46 Correct 281 ms 192852 KB Output is correct
47 Correct 277 ms 191432 KB Output is correct
48 Correct 282 ms 192912 KB Output is correct
49 Correct 275 ms 190912 KB Output is correct
50 Correct 280 ms 192268 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12888 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 4 ms 13916 KB Output is correct
17 Correct 4 ms 13892 KB Output is correct
18 Correct 4 ms 13912 KB Output is correct
19 Correct 16 ms 23644 KB Output is correct
20 Correct 21 ms 23644 KB Output is correct
21 Correct 17 ms 23536 KB Output is correct
22 Correct 15 ms 22620 KB Output is correct
23 Correct 20 ms 23132 KB Output is correct
24 Correct 15 ms 22528 KB Output is correct
25 Correct 13 ms 22364 KB Output is correct
26 Correct 14 ms 22616 KB Output is correct
27 Correct 2194 ms 771064 KB Output is correct
28 Correct 2323 ms 772652 KB Output is correct
29 Correct 2311 ms 772424 KB Output is correct
30 Correct 2214 ms 769120 KB Output is correct
31 Correct 1425 ms 454476 KB Output is correct
32 Correct 1313 ms 674200 KB Output is correct
33 Correct 1660 ms 690876 KB Output is correct
34 Correct 1529 ms 686424 KB Output is correct
35 Correct 2 ms 12636 KB Output is correct
36 Correct 589 ms 204624 KB Output is correct
37 Correct 2110 ms 695444 KB Output is correct
38 Correct 2074 ms 696512 KB Output is correct
39 Correct 2463 ms 704116 KB Output is correct
40 Correct 1137 ms 364736 KB Output is correct
41 Correct 456 ms 190660 KB Output is correct
42 Correct 64 ms 52116 KB Output is correct
43 Correct 2183 ms 700344 KB Output is correct
44 Correct 2929 ms 715696 KB Output is correct
45 Correct 1705 ms 691044 KB Output is correct
46 Correct 1069 ms 659104 KB Output is correct
47 Correct 2882 ms 743768 KB Output is correct
48 Correct 1160 ms 663764 KB Output is correct
49 Correct 1120 ms 659840 KB Output is correct
50 Correct 2830 ms 758192 KB Output is correct
51 Correct 35 ms 34908 KB Output is correct
52 Correct 36 ms 34956 KB Output is correct
53 Correct 41 ms 34904 KB Output is correct
54 Correct 47 ms 33372 KB Output is correct
55 Correct 29 ms 32848 KB Output is correct
56 Correct 30 ms 32604 KB Output is correct
57 Correct 518 ms 223820 KB Output is correct
58 Correct 621 ms 224884 KB Output is correct
59 Correct 625 ms 226400 KB Output is correct
60 Correct 432 ms 198856 KB Output is correct
61 Correct 444 ms 199256 KB Output is correct
62 Correct 471 ms 201160 KB Output is correct
63 Correct 167 ms 72384 KB Output is correct
64 Correct 166 ms 72472 KB Output is correct
65 Correct 159 ms 72388 KB Output is correct
66 Correct 190 ms 76228 KB Output is correct
67 Correct 295 ms 193228 KB Output is correct
68 Correct 274 ms 191900 KB Output is correct
69 Correct 278 ms 192968 KB Output is correct
70 Correct 281 ms 192852 KB Output is correct
71 Correct 277 ms 191432 KB Output is correct
72 Correct 282 ms 192912 KB Output is correct
73 Correct 275 ms 190912 KB Output is correct
74 Correct 280 ms 192268 KB Output is correct
75 Correct 2362 ms 780760 KB Output is correct
76 Correct 2437 ms 779528 KB Output is correct
77 Correct 1931 ms 777040 KB Output is correct
78 Correct 2076 ms 775508 KB Output is correct
79 Correct 2520 ms 773092 KB Output is correct
80 Correct 2170 ms 776580 KB Output is correct
81 Correct 2027 ms 702688 KB Output is correct
82 Correct 1799 ms 697212 KB Output is correct
83 Correct 1824 ms 697624 KB Output is correct
84 Correct 2324 ms 709032 KB Output is correct
85 Correct 1921 ms 700564 KB Output is correct
86 Correct 1785 ms 695500 KB Output is correct
87 Execution timed out 3035 ms 728824 KB Time limit exceeded
88 Halted 0 ms 0 KB -