oj.uz

답안 #851449

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
851449 2023-09-19T19:46:38 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 232104 KB 
#include <bits/stdc++.h>

using namespace std;
typedef pair<int, int> pii;

const int INF = 1010101010;
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;

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

	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) {
		p += base; p--;
		vector<pair<int, set<pii>::iterator>> v;
		while (p >= 1) {
			v.emplace_back(p, T[p].s.lower_bound({y, 0}));
			p >>= 1;
		}
		pii m1, m2;
		m1 = m2 = {INF, 0};
		for (auto j : v) {
			int p = j.first;
			auto it = j.second;
			if (it == T[p].s.end()) continue;
			if (*it <= m1) {
				m2 = m1; m1 = *it;
				if (next(it) != T[p].s.end()) m2 = min(m2, *next(it));
			} else {
				m2 = min(m2, *it);
			}
		}
		if (m1.first != INF) chk(m1.second);
		if (m2.first != INF) chk(m2.second);
		m1 = m2 = {-INF, 0};
		for (auto j : v) {
			int p = j.first;
			auto it = j.second;
			if (it == T[p].s.begin()) continue;
			auto pit = prev(it);
			if (*pit >= m1) {
				m2 = m1; m1 = *pit;
				if (pit != T[p].s.begin()) m2 = max(m2, *prev(pit));
			} else {
				m2 = max(m2, *pit);
			}
		}
		if (m1.first != -INF) chk(m1.second);
		if (m2.first != -INF) chk(m2.second);
	}
};

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> 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]);
		seg.get(XR[i], Y[i], R[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:135:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  135 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:135:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  135 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |                                                      ^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6744 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 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 6488 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 2 ms 6744 KB Output is correct
18 Correct 2 ms 6744 KB Output is correct
19 Correct 6 ms 8280 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 6 ms 8280 KB Output is correct
22 Correct 7 ms 8792 KB Output is correct
23 Correct 11 ms 9304 KB Output is correct
24 Correct 6 ms 8536 KB Output is correct
25 Correct 6 ms 8280 KB Output is correct
26 Correct 6 ms 8540 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 545 ms 111608 KB Output is correct
2 Correct 555 ms 112112 KB Output is correct
3 Correct 508 ms 112512 KB Output is correct
4 Correct 527 ms 112152 KB Output is correct
5 Correct 456 ms 63760 KB Output is correct
6 Correct 509 ms 123788 KB Output is correct
7 Correct 537 ms 114964 KB Output is correct
8 Correct 581 ms 117900 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 340 ms 55396 KB Output is correct
3 Correct 1291 ms 179140 KB Output is correct
4 Correct 1347 ms 177708 KB Output is correct
5 Correct 1523 ms 176564 KB Output is correct
6 Correct 592 ms 82100 KB Output is correct
7 Correct 184 ms 42156 KB Output is correct
8 Correct 22 ms 14120 KB Output is correct
9 Correct 1390 ms 179596 KB Output is correct
10 Correct 1808 ms 170624 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 893 ms 169504 KB Output is correct
2 Correct 418 ms 134276 KB Output is correct
3 Correct 949 ms 119412 KB Output is correct
4 Correct 471 ms 136456 KB Output is correct
5 Correct 440 ms 134332 KB Output is correct
6 Correct 803 ms 113820 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6744 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 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 6488 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 2 ms 6744 KB Output is correct
18 Correct 2 ms 6744 KB Output is correct
19 Correct 6 ms 8280 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 6 ms 8280 KB Output is correct
22 Correct 7 ms 8792 KB Output is correct
23 Correct 11 ms 9304 KB Output is correct
24 Correct 6 ms 8536 KB Output is correct
25 Correct 6 ms 8280 KB Output is correct
26 Correct 6 ms 8540 KB Output is correct
27 Correct 10 ms 9816 KB Output is correct
28 Correct 11 ms 9816 KB Output is correct
29 Correct 10 ms 9816 KB Output is correct
30 Correct 16 ms 11608 KB Output is correct
31 Correct 12 ms 10840 KB Output is correct
32 Correct 12 ms 10844 KB Output is correct
33 Correct 122 ms 33020 KB Output is correct
34 Correct 125 ms 33100 KB Output is correct
35 Correct 134 ms 32964 KB Output is correct
36 Correct 184 ms 45640 KB Output is correct
37 Correct 185 ms 46264 KB Output is correct
38 Correct 242 ms 48324 KB Output is correct
39 Correct 149 ms 11580 KB Output is correct
40 Correct 154 ms 11556 KB Output is correct
41 Correct 148 ms 11384 KB Output is correct
42 Correct 165 ms 11716 KB Output is correct
43 Correct 121 ms 39876 KB Output is correct
44 Correct 124 ms 39500 KB Output is correct
45 Correct 132 ms 39812 KB Output is correct
46 Correct 125 ms 39872 KB Output is correct
47 Correct 117 ms 38848 KB Output is correct
48 Correct 120 ms 39872 KB Output is correct
49 Correct 116 ms 38552 KB Output is correct
50 Correct 118 ms 39364 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6744 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 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 6488 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 2 ms 6744 KB Output is correct
18 Correct 2 ms 6744 KB Output is correct
19 Correct 6 ms 8280 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 6 ms 8280 KB Output is correct
22 Correct 7 ms 8792 KB Output is correct
23 Correct 11 ms 9304 KB Output is correct
24 Correct 6 ms 8536 KB Output is correct
25 Correct 6 ms 8280 KB Output is correct
26 Correct 6 ms 8540 KB Output is correct
27 Correct 545 ms 111608 KB Output is correct
28 Correct 555 ms 112112 KB Output is correct
29 Correct 508 ms 112512 KB Output is correct
30 Correct 527 ms 112152 KB Output is correct
31 Correct 456 ms 63760 KB Output is correct
32 Correct 509 ms 123788 KB Output is correct
33 Correct 537 ms 114964 KB Output is correct
34 Correct 581 ms 117900 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 340 ms 55396 KB Output is correct
37 Correct 1291 ms 179140 KB Output is correct
38 Correct 1347 ms 177708 KB Output is correct
39 Correct 1523 ms 176564 KB Output is correct
40 Correct 592 ms 82100 KB Output is correct
41 Correct 184 ms 42156 KB Output is correct
42 Correct 22 ms 14120 KB Output is correct
43 Correct 1390 ms 179596 KB Output is correct
44 Correct 1808 ms 170624 KB Output is correct
45 Correct 893 ms 169504 KB Output is correct
46 Correct 418 ms 134276 KB Output is correct
47 Correct 949 ms 119412 KB Output is correct
48 Correct 471 ms 136456 KB Output is correct
49 Correct 440 ms 134332 KB Output is correct
50 Correct 803 ms 113820 KB Output is correct
51 Correct 10 ms 9816 KB Output is correct
52 Correct 11 ms 9816 KB Output is correct
53 Correct 10 ms 9816 KB Output is correct
54 Correct 16 ms 11608 KB Output is correct
55 Correct 12 ms 10840 KB Output is correct
56 Correct 12 ms 10844 KB Output is correct
57 Correct 122 ms 33020 KB Output is correct
58 Correct 125 ms 33100 KB Output is correct
59 Correct 134 ms 32964 KB Output is correct
60 Correct 184 ms 45640 KB Output is correct
61 Correct 185 ms 46264 KB Output is correct
62 Correct 242 ms 48324 KB Output is correct
63 Correct 149 ms 11580 KB Output is correct
64 Correct 154 ms 11556 KB Output is correct
65 Correct 148 ms 11384 KB Output is correct
66 Correct 165 ms 11716 KB Output is correct
67 Correct 121 ms 39876 KB Output is correct
68 Correct 124 ms 39500 KB Output is correct
69 Correct 132 ms 39812 KB Output is correct
70 Correct 125 ms 39872 KB Output is correct
71 Correct 117 ms 38848 KB Output is correct
72 Correct 120 ms 39872 KB Output is correct
73 Correct 116 ms 38552 KB Output is correct
74 Correct 118 ms 39364 KB Output is correct
75 Correct 522 ms 112552 KB Output is correct
76 Correct 521 ms 112148 KB Output is correct
77 Correct 429 ms 112628 KB Output is correct
78 Correct 492 ms 111700 KB Output is correct
79 Correct 656 ms 113372 KB Output is correct
80 Correct 510 ms 112896 KB Output is correct
81 Correct 1155 ms 174008 KB Output is correct
82 Correct 1016 ms 164372 KB Output is correct
83 Correct 1004 ms 164600 KB Output is correct
84 Correct 1626 ms 188580 KB Output is correct
85 Correct 1101 ms 170652 KB Output is correct
86 Correct 942 ms 162148 KB Output is correct
87 Execution timed out 3045 ms 232104 KB Time limit exceeded
88 Halted 0 ms 0 KB -