oj.uz

답안 #854735

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
854735 2023-09-28T16:37:40 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 772252 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;

	void init(int _n) {
		n = _n;
		l.resize(n + 1); r.resize(n + 1);
		c.resize(n); chk.resize(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.init(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:153: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]
  153 |      if (t >= T[p].v.size()) break;
      |          ~~^~~~~~~~~~~~~~~~
circle_selection.cpp:171: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]
  171 |      if (t >= T[p].v.size()) break;
      |          ~~^~~~~~~~~~~~~~~~
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:228:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  228 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:228:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  228 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |                                                      ^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 12636 KB Output is correct
2 Correct 1 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 1 ms 12636 KB Output is correct
5 Correct 1 ms 12636 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12736 KB Output is correct
8 Correct 2 ms 12888 KB Output is correct
9 Correct 2 ms 12888 KB Output is correct
10 Correct 2 ms 12888 KB Output is correct
11 Correct 2 ms 12892 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 12824 KB Output is correct
16 Correct 4 ms 13916 KB Output is correct
17 Correct 4 ms 13916 KB Output is correct
18 Correct 4 ms 13916 KB Output is correct
19 Correct 17 ms 23640 KB Output is correct
20 Correct 15 ms 23676 KB Output is correct
21 Correct 17 ms 23640 KB Output is correct
22 Correct 14 ms 22620 KB Output is correct
23 Correct 17 ms 23124 KB Output is correct
24 Correct 13 ms 22580 KB Output is correct
25 Correct 12 ms 22364 KB Output is correct
26 Correct 18 ms 22620 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2099 ms 770144 KB Output is correct
2 Correct 2257 ms 772032 KB Output is correct
3 Correct 2155 ms 772252 KB Output is correct
4 Correct 2093 ms 770428 KB Output is correct
5 Correct 1295 ms 453300 KB Output is correct
6 Correct 1276 ms 674780 KB Output is correct
7 Correct 1577 ms 691724 KB Output is correct
8 Correct 1502 ms 687692 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 556 ms 205012 KB Output is correct
3 Correct 2062 ms 696912 KB Output is correct
4 Correct 2056 ms 696876 KB Output is correct
5 Correct 2387 ms 704808 KB Output is correct
6 Correct 1106 ms 364736 KB Output is correct
7 Correct 438 ms 190484 KB Output is correct
8 Correct 68 ms 52172 KB Output is correct
9 Correct 2180 ms 698488 KB Output is correct
10 Correct 2785 ms 716308 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1613 ms 690308 KB Output is correct
2 Correct 974 ms 659504 KB Output is correct
3 Correct 2799 ms 745504 KB Output is correct
4 Correct 1114 ms 663196 KB Output is correct
5 Correct 1031 ms 660400 KB Output is correct
6 Correct 2710 ms 757372 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 12636 KB Output is correct
2 Correct 1 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 1 ms 12636 KB Output is correct
5 Correct 1 ms 12636 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12736 KB Output is correct
8 Correct 2 ms 12888 KB Output is correct
9 Correct 2 ms 12888 KB Output is correct
10 Correct 2 ms 12888 KB Output is correct
11 Correct 2 ms 12892 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 12824 KB Output is correct
16 Correct 4 ms 13916 KB Output is correct
17 Correct 4 ms 13916 KB Output is correct
18 Correct 4 ms 13916 KB Output is correct
19 Correct 17 ms 23640 KB Output is correct
20 Correct 15 ms 23676 KB Output is correct
21 Correct 17 ms 23640 KB Output is correct
22 Correct 14 ms 22620 KB Output is correct
23 Correct 17 ms 23124 KB Output is correct
24 Correct 13 ms 22580 KB Output is correct
25 Correct 12 ms 22364 KB Output is correct
26 Correct 18 ms 22620 KB Output is correct
27 Correct 41 ms 34904 KB Output is correct
28 Correct 38 ms 34900 KB Output is correct
29 Correct 40 ms 34904 KB Output is correct
30 Correct 44 ms 33440 KB Output is correct
31 Correct 34 ms 32852 KB Output is correct
32 Correct 28 ms 32604 KB Output is correct
33 Correct 478 ms 223720 KB Output is correct
34 Correct 514 ms 224968 KB Output is correct
35 Correct 582 ms 226580 KB Output is correct
36 Correct 410 ms 198812 KB Output is correct
37 Correct 412 ms 199112 KB Output is correct
38 Correct 468 ms 201132 KB Output is correct
39 Correct 169 ms 72608 KB Output is correct
40 Correct 156 ms 72316 KB Output is correct
41 Correct 159 ms 72388 KB Output is correct
42 Correct 203 ms 76236 KB Output is correct
43 Correct 263 ms 193144 KB Output is correct
44 Correct 270 ms 192148 KB Output is correct
45 Correct 266 ms 192964 KB Output is correct
46 Correct 259 ms 193288 KB Output is correct
47 Correct 263 ms 191424 KB Output is correct
48 Correct 261 ms 192956 KB Output is correct
49 Correct 266 ms 190776 KB Output is correct
50 Correct 254 ms 192132 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 12636 KB Output is correct
2 Correct 1 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 1 ms 12636 KB Output is correct
5 Correct 1 ms 12636 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12736 KB Output is correct
8 Correct 2 ms 12888 KB Output is correct
9 Correct 2 ms 12888 KB Output is correct
10 Correct 2 ms 12888 KB Output is correct
11 Correct 2 ms 12892 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 12824 KB Output is correct
16 Correct 4 ms 13916 KB Output is correct
17 Correct 4 ms 13916 KB Output is correct
18 Correct 4 ms 13916 KB Output is correct
19 Correct 17 ms 23640 KB Output is correct
20 Correct 15 ms 23676 KB Output is correct
21 Correct 17 ms 23640 KB Output is correct
22 Correct 14 ms 22620 KB Output is correct
23 Correct 17 ms 23124 KB Output is correct
24 Correct 13 ms 22580 KB Output is correct
25 Correct 12 ms 22364 KB Output is correct
26 Correct 18 ms 22620 KB Output is correct
27 Correct 2099 ms 770144 KB Output is correct
28 Correct 2257 ms 772032 KB Output is correct
29 Correct 2155 ms 772252 KB Output is correct
30 Correct 2093 ms 770428 KB Output is correct
31 Correct 1295 ms 453300 KB Output is correct
32 Correct 1276 ms 674780 KB Output is correct
33 Correct 1577 ms 691724 KB Output is correct
34 Correct 1502 ms 687692 KB Output is correct
35 Correct 2 ms 12632 KB Output is correct
36 Correct 556 ms 205012 KB Output is correct
37 Correct 2062 ms 696912 KB Output is correct
38 Correct 2056 ms 696876 KB Output is correct
39 Correct 2387 ms 704808 KB Output is correct
40 Correct 1106 ms 364736 KB Output is correct
41 Correct 438 ms 190484 KB Output is correct
42 Correct 68 ms 52172 KB Output is correct
43 Correct 2180 ms 698488 KB Output is correct
44 Correct 2785 ms 716308 KB Output is correct
45 Correct 1613 ms 690308 KB Output is correct
46 Correct 974 ms 659504 KB Output is correct
47 Correct 2799 ms 745504 KB Output is correct
48 Correct 1114 ms 663196 KB Output is correct
49 Correct 1031 ms 660400 KB Output is correct
50 Correct 2710 ms 757372 KB Output is correct
51 Correct 41 ms 34904 KB Output is correct
52 Correct 38 ms 34900 KB Output is correct
53 Correct 40 ms 34904 KB Output is correct
54 Correct 44 ms 33440 KB Output is correct
55 Correct 34 ms 32852 KB Output is correct
56 Correct 28 ms 32604 KB Output is correct
57 Correct 478 ms 223720 KB Output is correct
58 Correct 514 ms 224968 KB Output is correct
59 Correct 582 ms 226580 KB Output is correct
60 Correct 410 ms 198812 KB Output is correct
61 Correct 412 ms 199112 KB Output is correct
62 Correct 468 ms 201132 KB Output is correct
63 Correct 169 ms 72608 KB Output is correct
64 Correct 156 ms 72316 KB Output is correct
65 Correct 159 ms 72388 KB Output is correct
66 Correct 203 ms 76236 KB Output is correct
67 Correct 263 ms 193144 KB Output is correct
68 Correct 270 ms 192148 KB Output is correct
69 Correct 266 ms 192964 KB Output is correct
70 Correct 259 ms 193288 KB Output is correct
71 Correct 263 ms 191424 KB Output is correct
72 Correct 261 ms 192956 KB Output is correct
73 Correct 266 ms 190776 KB Output is correct
74 Correct 254 ms 192132 KB Output is correct
75 Correct 2228 ms 772088 KB Output is correct
76 Correct 2279 ms 770012 KB Output is correct
77 Correct 1797 ms 766980 KB Output is correct
78 Correct 1985 ms 766484 KB Output is correct
79 Correct 2415 ms 765436 KB Output is correct
80 Correct 2029 ms 768004 KB Output is correct
81 Correct 1925 ms 693784 KB Output is correct
82 Correct 1713 ms 689524 KB Output is correct
83 Correct 1733 ms 689148 KB Output is correct
84 Correct 2230 ms 701768 KB Output is correct
85 Correct 1794 ms 692412 KB Output is correct
86 Correct 1681 ms 688836 KB Output is correct
87 Execution timed out 3052 ms 722568 KB Time limit exceeded
88 Halted 0 ms 0 KB -