oj.uz

답안 #854746

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
854746 2023-09-28T17:34:35 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++17
64 / 100
 1675 ms 189220 KB 
#pragma GCC optimize("O3")
#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;

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

struct Comp {
	bool operator() (int a, int b) const {
		return Y[a] < Y[b];
	}
};

struct SegTree {
	struct Node {
		set<int, Comp> s;
	};

	int n, base;
	vector<Node> T;
	vector<int> L;

	SegTree(int _n) : n(_n) {
		for (base = 1; base < n; base <<= 1);
		T.resize(base + base);
		L.resize(base + base);
		for (int i = base; i < base + base; i++) L[i] = i - base + 1;
		for (int i = base - 1; i >= 1; i--) L[i] = L[i << 1];
	}

	void chk_node(int idx, int r, int li) {
		auto it = T[idx].s.lower_bound(cur);
		auto tmp = it;
		for (int i = 0; i < K; i++) {
			if (it == T[idx].s.end()) break;
			if (XL[*it] <= li) break;
			chk(*it);
			if (Y[*it] >= (long long)Y[cur] + r + r) break;
			if (i < K - 1) it++;
		}
		it = tmp;
		for (int i = 0; i < K; i++) {
			if (it == T[idx].s.begin()) break;
			it--;
			if (XL[*it] <= li) break;
			chk(*it);
			if (*it <= (long long)Y[cur] - r - r) break;
		}
	}

	void upd(int p, int q, int 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 r, int li) {
		p += base; p--;
		while (p >= 1) {
			if (L[p] <= li) break;
			chk_node(p, r, li);
			p >>= 1;
		}
	}
};

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], R[i], 0);
		seg.get(XR[i], R[i], XL[i]);
		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 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 6492 KB Output is correct
2 Correct 1 ms 6644 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 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 6492 KB Output is correct
9 Correct 1 ms 6492 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 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 6 ms 8284 KB Output is correct
21 Correct 5 ms 8376 KB Output is correct
22 Correct 6 ms 8796 KB Output is correct
23 Correct 10 ms 9564 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8460 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 411 ms 120736 KB Output is correct
2 Correct 434 ms 121120 KB Output is correct
3 Correct 363 ms 119832 KB Output is correct
4 Correct 373 ms 121012 KB Output is correct
5 Correct 300 ms 67252 KB Output is correct
6 Correct 391 ms 131312 KB Output is correct
7 Correct 361 ms 122292 KB Output is correct
8 Correct 348 ms 125572 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 292 ms 57436 KB Output is correct
3 Correct 1002 ms 185720 KB Output is correct
4 Correct 963 ms 185416 KB Output is correct
5 Correct 1326 ms 184532 KB Output is correct
6 Correct 436 ms 85948 KB Output is correct
7 Correct 134 ms 44228 KB Output is correct
8 Correct 16 ms 14552 KB Output is correct
9 Correct 1084 ms 189220 KB Output is correct
10 Correct 1675 ms 179636 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 762 ms 176500 KB Output is correct
2 Correct 307 ms 142268 KB Output is correct
3 Correct 770 ms 127816 KB Output is correct
4 Correct 358 ms 145016 KB Output is correct
5 Correct 327 ms 143516 KB Output is correct
6 Incorrect 607 ms 122312 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6644 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 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 6492 KB Output is correct
9 Correct 1 ms 6492 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 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 6 ms 8284 KB Output is correct
21 Correct 5 ms 8376 KB Output is correct
22 Correct 6 ms 8796 KB Output is correct
23 Correct 10 ms 9564 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8460 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 8 ms 10072 KB Output is correct
28 Correct 8 ms 10272 KB Output is correct
29 Correct 8 ms 10076 KB Output is correct
30 Correct 13 ms 11868 KB Output is correct
31 Correct 10 ms 11172 KB Output is correct
32 Correct 10 ms 11088 KB Output is correct
33 Correct 96 ms 35172 KB Output is correct
34 Correct 102 ms 35128 KB Output is correct
35 Correct 104 ms 35008 KB Output is correct
36 Correct 145 ms 47868 KB Output is correct
37 Correct 152 ms 48328 KB Output is correct
38 Correct 174 ms 50372 KB Output is correct
39 Correct 138 ms 11472 KB Output is correct
40 Correct 127 ms 11588 KB Output is correct
41 Correct 132 ms 11600 KB Output is correct
42 Correct 125 ms 11716 KB Output is correct
43 Correct 113 ms 41924 KB Output is correct
44 Correct 95 ms 41364 KB Output is correct
45 Correct 99 ms 42180 KB Output is correct
46 Correct 98 ms 41804 KB Output is correct
47 Correct 91 ms 41064 KB Output is correct
48 Correct 93 ms 41924 KB Output is correct
49 Correct 92 ms 40644 KB Output is correct
50 Correct 96 ms 41376 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6644 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 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 6492 KB Output is correct
9 Correct 1 ms 6492 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 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 6 ms 8284 KB Output is correct
21 Correct 5 ms 8376 KB Output is correct
22 Correct 6 ms 8796 KB Output is correct
23 Correct 10 ms 9564 KB Output is correct
24 Correct 5 ms 8796 KB Output is correct
25 Correct 5 ms 8460 KB Output is correct
26 Correct 5 ms 8796 KB Output is correct
27 Correct 411 ms 120736 KB Output is correct
28 Correct 434 ms 121120 KB Output is correct
29 Correct 363 ms 119832 KB Output is correct
30 Correct 373 ms 121012 KB Output is correct
31 Correct 300 ms 67252 KB Output is correct
32 Correct 391 ms 131312 KB Output is correct
33 Correct 361 ms 122292 KB Output is correct
34 Correct 348 ms 125572 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 292 ms 57436 KB Output is correct
37 Correct 1002 ms 185720 KB Output is correct
38 Correct 963 ms 185416 KB Output is correct
39 Correct 1326 ms 184532 KB Output is correct
40 Correct 436 ms 85948 KB Output is correct
41 Correct 134 ms 44228 KB Output is correct
42 Correct 16 ms 14552 KB Output is correct
43 Correct 1084 ms 189220 KB Output is correct
44 Correct 1675 ms 179636 KB Output is correct
45 Correct 762 ms 176500 KB Output is correct
46 Correct 307 ms 142268 KB Output is correct
47 Correct 770 ms 127816 KB Output is correct
48 Correct 358 ms 145016 KB Output is correct
49 Correct 327 ms 143516 KB Output is correct
50 Incorrect 607 ms 122312 KB Output isn't correct
51 Halted 0 ms 0 KB -