oj.uz

답안 #851261

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

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

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

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;
}

void chk(int cand) {
	if (intersect(cur, cand)) {
		int &t = ans[cur];
		if (pii(R[cand], -cand) > pii(R[t], -t)) 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 chk_node(int idx, int y) {
		auto it = T[idx].s.lower_bound({y, 0});
		auto tmp = it;
		for (int i = 0; i < K; i++) {
			if (it == T[idx].s.end()) break;
			chk(it->second);
			it++;
		}
		it = tmp;
		for (int i = 0; i < K; i++) {
			if (it == T[idx].s.begin()) break;
			it--;
			chk(it->second);
		}
	}

	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) {
		p += base; p--;
		while (p >= 1) {
			chk_node(p, y);
			p >>= 1;
		}
	}
};

int main() {
	scanf("%d", &N);
	vector<int> v;
	for (int i = 1; i <= N; i++) {
		scanf("%d%d%d", &X[i], &Y[i], &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]);
		seg.get(XR[i], Y[i]);
		if (ans[i] == i) seg.upd(XL[i], XR[i], {Y[i] + R[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:111:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  111 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:111:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  111 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |                                                      ^~~~
circle_selection.cpp:79:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
circle_selection.cpp:82:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |   scanf("%d%d%d", &X[i], &Y[i], &R[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 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 6744 KB Output is correct
7 Correct 1 ms 6492 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 6492 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 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 2 ms 7000 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 5 ms 8196 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 6 ms 8752 KB Output is correct
23 Correct 10 ms 9308 KB Output is correct
24 Correct 6 ms 8548 KB Output is correct
25 Correct 5 ms 8284 KB Output is correct
26 Correct 8 ms 8540 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 411 ms 112744 KB Output is correct
2 Correct 401 ms 113084 KB Output is correct
3 Correct 415 ms 112980 KB Output is correct
4 Correct 408 ms 111912 KB Output is correct
5 Correct 347 ms 63924 KB Output is correct
6 Correct 412 ms 123316 KB Output is correct
7 Correct 412 ms 114340 KB Output is correct
8 Correct 414 ms 117552 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 285 ms 55368 KB Output is correct
3 Correct 1132 ms 177776 KB Output is correct
4 Correct 1052 ms 176844 KB Output is correct
5 Correct 1583 ms 175424 KB Output is correct
6 Correct 461 ms 81764 KB Output is correct
7 Correct 160 ms 42476 KB Output is correct
8 Correct 17 ms 14040 KB Output is correct
9 Correct 1266 ms 180020 KB Output is correct
10 Correct 2060 ms 170100 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 707 ms 169140 KB Output is correct
2 Correct 343 ms 133556 KB Output is correct
3 Correct 813 ms 119400 KB Output is correct
4 Correct 386 ms 137984 KB Output is correct
5 Correct 364 ms 134068 KB Output is correct
6 Correct 632 ms 113820 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 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 6744 KB Output is correct
7 Correct 1 ms 6492 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 6492 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 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 2 ms 7000 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 5 ms 8196 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 6 ms 8752 KB Output is correct
23 Correct 10 ms 9308 KB Output is correct
24 Correct 6 ms 8548 KB Output is correct
25 Correct 5 ms 8284 KB Output is correct
26 Correct 8 ms 8540 KB Output is correct
27 Correct 10 ms 9972 KB Output is correct
28 Correct 9 ms 9820 KB Output is correct
29 Correct 9 ms 9800 KB Output is correct
30 Correct 16 ms 11608 KB Output is correct
31 Correct 12 ms 10844 KB Output is correct
32 Correct 10 ms 10844 KB Output is correct
33 Correct 104 ms 33076 KB Output is correct
34 Correct 105 ms 33072 KB Output is correct
35 Correct 119 ms 32960 KB Output is correct
36 Correct 154 ms 45764 KB Output is correct
37 Correct 155 ms 46280 KB Output is correct
38 Correct 177 ms 48500 KB Output is correct
39 Correct 142 ms 11720 KB Output is correct
40 Correct 136 ms 11600 KB Output is correct
41 Correct 136 ms 11464 KB Output is correct
42 Correct 156 ms 11864 KB Output is correct
43 Correct 108 ms 39868 KB Output is correct
44 Correct 102 ms 39516 KB Output is correct
45 Correct 104 ms 40056 KB Output is correct
46 Correct 107 ms 39752 KB Output is correct
47 Correct 103 ms 38992 KB Output is correct
48 Correct 106 ms 39876 KB Output is correct
49 Correct 103 ms 38596 KB Output is correct
50 Correct 106 ms 39400 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 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 6744 KB Output is correct
7 Correct 1 ms 6492 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 6492 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 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 2 ms 7000 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 5 ms 8196 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 6 ms 8752 KB Output is correct
23 Correct 10 ms 9308 KB Output is correct
24 Correct 6 ms 8548 KB Output is correct
25 Correct 5 ms 8284 KB Output is correct
26 Correct 8 ms 8540 KB Output is correct
27 Correct 411 ms 112744 KB Output is correct
28 Correct 401 ms 113084 KB Output is correct
29 Correct 415 ms 112980 KB Output is correct
30 Correct 408 ms 111912 KB Output is correct
31 Correct 347 ms 63924 KB Output is correct
32 Correct 412 ms 123316 KB Output is correct
33 Correct 412 ms 114340 KB Output is correct
34 Correct 414 ms 117552 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 285 ms 55368 KB Output is correct
37 Correct 1132 ms 177776 KB Output is correct
38 Correct 1052 ms 176844 KB Output is correct
39 Correct 1583 ms 175424 KB Output is correct
40 Correct 461 ms 81764 KB Output is correct
41 Correct 160 ms 42476 KB Output is correct
42 Correct 17 ms 14040 KB Output is correct
43 Correct 1266 ms 180020 KB Output is correct
44 Correct 2060 ms 170100 KB Output is correct
45 Correct 707 ms 169140 KB Output is correct
46 Correct 343 ms 133556 KB Output is correct
47 Correct 813 ms 119400 KB Output is correct
48 Correct 386 ms 137984 KB Output is correct
49 Correct 364 ms 134068 KB Output is correct
50 Correct 632 ms 113820 KB Output is correct
51 Correct 10 ms 9972 KB Output is correct
52 Correct 9 ms 9820 KB Output is correct
53 Correct 9 ms 9800 KB Output is correct
54 Correct 16 ms 11608 KB Output is correct
55 Correct 12 ms 10844 KB Output is correct
56 Correct 10 ms 10844 KB Output is correct
57 Correct 104 ms 33076 KB Output is correct
58 Correct 105 ms 33072 KB Output is correct
59 Correct 119 ms 32960 KB Output is correct
60 Correct 154 ms 45764 KB Output is correct
61 Correct 155 ms 46280 KB Output is correct
62 Correct 177 ms 48500 KB Output is correct
63 Correct 142 ms 11720 KB Output is correct
64 Correct 136 ms 11600 KB Output is correct
65 Correct 136 ms 11464 KB Output is correct
66 Correct 156 ms 11864 KB Output is correct
67 Correct 108 ms 39868 KB Output is correct
68 Correct 102 ms 39516 KB Output is correct
69 Correct 104 ms 40056 KB Output is correct
70 Correct 107 ms 39752 KB Output is correct
71 Correct 103 ms 38992 KB Output is correct
72 Correct 106 ms 39876 KB Output is correct
73 Correct 103 ms 38596 KB Output is correct
74 Correct 106 ms 39400 KB Output is correct
75 Correct 413 ms 111724 KB Output is correct
76 Correct 417 ms 111816 KB Output is correct
77 Correct 375 ms 113092 KB Output is correct
78 Correct 396 ms 112392 KB Output is correct
79 Incorrect 477 ms 113848 KB Output isn't correct
80 Halted 0 ms 0 KB -