oj.uz

답안 #854733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
854733 2023-09-28T16:31:52 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
64 / 100
 3000 ms 772308 KB 
#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) {
		if (chk[x]) return;
		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:148: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]
  148 |      if (t >= T[p].v.size()) break;
      |          ~~^~~~~~~~~~~~~~~~
circle_selection.cpp:166: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]
  166 |      if (t >= T[p].v.size()) break;
      |          ~~^~~~~~~~~~~~~~~~
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:223:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  223 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:223:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  223 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |                                                      ^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12632 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 12632 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12892 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 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12888 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 1 ms 12892 KB Output is correct
16 Correct 4 ms 13960 KB Output is correct
17 Correct 4 ms 14020 KB Output is correct
18 Correct 3 ms 13916 KB Output is correct
19 Correct 17 ms 23616 KB Output is correct
20 Correct 16 ms 23644 KB Output is correct
21 Correct 17 ms 23688 KB Output is correct
22 Correct 14 ms 22620 KB Output is correct
23 Correct 26 ms 23276 KB Output is correct
24 Correct 15 ms 22620 KB Output is correct
25 Correct 14 ms 22316 KB Output is correct
26 Correct 13 ms 22620 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2130 ms 770484 KB Output is correct
2 Correct 2257 ms 772308 KB Output is correct
3 Correct 2245 ms 771132 KB Output is correct
4 Correct 2115 ms 770532 KB Output is correct
5 Correct 1426 ms 453296 KB Output is correct
6 Correct 1325 ms 674444 KB Output is correct
7 Correct 1682 ms 691664 KB Output is correct
8 Correct 1580 ms 687168 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 602 ms 204676 KB Output is correct
3 Correct 2159 ms 696292 KB Output is correct
4 Correct 2126 ms 696624 KB Output is correct
5 Correct 2532 ms 704404 KB Output is correct
6 Correct 1098 ms 364888 KB Output is correct
7 Correct 434 ms 190660 KB Output is correct
8 Correct 58 ms 52248 KB Output is correct
9 Correct 2180 ms 700388 KB Output is correct
10 Correct 2978 ms 716296 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1685 ms 690264 KB Output is correct
2 Correct 1052 ms 660876 KB Output is correct
3 Execution timed out 3017 ms 744292 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12632 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 12632 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12892 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 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12888 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 1 ms 12892 KB Output is correct
16 Correct 4 ms 13960 KB Output is correct
17 Correct 4 ms 14020 KB Output is correct
18 Correct 3 ms 13916 KB Output is correct
19 Correct 17 ms 23616 KB Output is correct
20 Correct 16 ms 23644 KB Output is correct
21 Correct 17 ms 23688 KB Output is correct
22 Correct 14 ms 22620 KB Output is correct
23 Correct 26 ms 23276 KB Output is correct
24 Correct 15 ms 22620 KB Output is correct
25 Correct 14 ms 22316 KB Output is correct
26 Correct 13 ms 22620 KB Output is correct
27 Correct 36 ms 34900 KB Output is correct
28 Correct 36 ms 34896 KB Output is correct
29 Correct 36 ms 34908 KB Output is correct
30 Correct 36 ms 33452 KB Output is correct
31 Correct 29 ms 32860 KB Output is correct
32 Correct 28 ms 32604 KB Output is correct
33 Correct 515 ms 223616 KB Output is correct
34 Correct 563 ms 224904 KB Output is correct
35 Correct 626 ms 226600 KB Output is correct
36 Correct 437 ms 198848 KB Output is correct
37 Correct 435 ms 199480 KB Output is correct
38 Correct 487 ms 200896 KB Output is correct
39 Correct 155 ms 72388 KB Output is correct
40 Correct 158 ms 72392 KB Output is correct
41 Correct 154 ms 72388 KB Output is correct
42 Correct 208 ms 76716 KB Output is correct
43 Correct 286 ms 193156 KB Output is correct
44 Correct 275 ms 191944 KB Output is correct
45 Correct 286 ms 192916 KB Output is correct
46 Correct 278 ms 192916 KB Output is correct
47 Correct 270 ms 191432 KB Output is correct
48 Correct 274 ms 192968 KB Output is correct
49 Correct 279 ms 190732 KB Output is correct
50 Correct 283 ms 192196 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12632 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 12632 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12892 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 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12888 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 1 ms 12892 KB Output is correct
16 Correct 4 ms 13960 KB Output is correct
17 Correct 4 ms 14020 KB Output is correct
18 Correct 3 ms 13916 KB Output is correct
19 Correct 17 ms 23616 KB Output is correct
20 Correct 16 ms 23644 KB Output is correct
21 Correct 17 ms 23688 KB Output is correct
22 Correct 14 ms 22620 KB Output is correct
23 Correct 26 ms 23276 KB Output is correct
24 Correct 15 ms 22620 KB Output is correct
25 Correct 14 ms 22316 KB Output is correct
26 Correct 13 ms 22620 KB Output is correct
27 Correct 2130 ms 770484 KB Output is correct
28 Correct 2257 ms 772308 KB Output is correct
29 Correct 2245 ms 771132 KB Output is correct
30 Correct 2115 ms 770532 KB Output is correct
31 Correct 1426 ms 453296 KB Output is correct
32 Correct 1325 ms 674444 KB Output is correct
33 Correct 1682 ms 691664 KB Output is correct
34 Correct 1580 ms 687168 KB Output is correct
35 Correct 2 ms 12636 KB Output is correct
36 Correct 602 ms 204676 KB Output is correct
37 Correct 2159 ms 696292 KB Output is correct
38 Correct 2126 ms 696624 KB Output is correct
39 Correct 2532 ms 704404 KB Output is correct
40 Correct 1098 ms 364888 KB Output is correct
41 Correct 434 ms 190660 KB Output is correct
42 Correct 58 ms 52248 KB Output is correct
43 Correct 2180 ms 700388 KB Output is correct
44 Correct 2978 ms 716296 KB Output is correct
45 Correct 1685 ms 690264 KB Output is correct
46 Correct 1052 ms 660876 KB Output is correct
47 Execution timed out 3017 ms 744292 KB Time limit exceeded
48 Halted 0 ms 0 KB -