oj.uz

답안 #794711

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
794711 2023-07-26T19:38:35 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++14
87 / 100
 3000 ms 227884 KB 
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>

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

const int INF = 2020202020;
const int K = 5;

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});
		for (int i = 0; i < K; i++) {
			if (it == T[idx].s.end()) break;
			chk(it->second);
			it++;
		}
	}

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

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 2132 KB Output is correct
20 Correct 4 ms 2132 KB Output is correct
21 Correct 4 ms 2004 KB Output is correct
22 Correct 6 ms 2516 KB Output is correct
23 Correct 9 ms 3220 KB Output is correct
24 Correct 5 ms 2516 KB Output is correct
25 Correct 5 ms 2260 KB Output is correct
26 Correct 5 ms 2516 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 464 ms 111396 KB Output is correct
2 Correct 444 ms 111436 KB Output is correct
3 Correct 435 ms 111156 KB Output is correct
4 Correct 439 ms 111452 KB Output is correct
5 Correct 416 ms 63196 KB Output is correct
6 Correct 454 ms 122172 KB Output is correct
7 Correct 467 ms 114036 KB Output is correct
8 Correct 497 ms 116228 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 272 ms 51288 KB Output is correct
3 Correct 1059 ms 177180 KB Output is correct
4 Correct 1112 ms 176604 KB Output is correct
5 Correct 1407 ms 174272 KB Output is correct
6 Correct 484 ms 78896 KB Output is correct
7 Correct 160 ms 37736 KB Output is correct
8 Correct 20 ms 8172 KB Output is correct
9 Correct 1267 ms 179640 KB Output is correct
10 Correct 1946 ms 169648 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 744 ms 168304 KB Output is correct
2 Correct 399 ms 132744 KB Output is correct
3 Correct 845 ms 118456 KB Output is correct
4 Correct 429 ms 136448 KB Output is correct
5 Correct 399 ms 133848 KB Output is correct
6 Correct 715 ms 112380 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 2132 KB Output is correct
20 Correct 4 ms 2132 KB Output is correct
21 Correct 4 ms 2004 KB Output is correct
22 Correct 6 ms 2516 KB Output is correct
23 Correct 9 ms 3220 KB Output is correct
24 Correct 5 ms 2516 KB Output is correct
25 Correct 5 ms 2260 KB Output is correct
26 Correct 5 ms 2516 KB Output is correct
27 Correct 9 ms 3864 KB Output is correct
28 Correct 11 ms 3880 KB Output is correct
29 Correct 9 ms 3828 KB Output is correct
30 Correct 14 ms 5588 KB Output is correct
31 Correct 11 ms 4840 KB Output is correct
32 Correct 10 ms 4784 KB Output is correct
33 Correct 109 ms 29052 KB Output is correct
34 Correct 117 ms 29048 KB Output is correct
35 Correct 121 ms 29056 KB Output is correct
36 Correct 163 ms 41716 KB Output is correct
37 Correct 169 ms 42188 KB Output is correct
38 Correct 181 ms 44412 KB Output is correct
39 Correct 146 ms 7540 KB Output is correct
40 Correct 143 ms 7520 KB Output is correct
41 Correct 148 ms 7464 KB Output is correct
42 Correct 148 ms 7704 KB Output is correct
43 Correct 116 ms 35948 KB Output is correct
44 Correct 113 ms 35232 KB Output is correct
45 Correct 115 ms 35824 KB Output is correct
46 Correct 130 ms 35836 KB Output is correct
47 Correct 115 ms 34992 KB Output is correct
48 Correct 114 ms 35840 KB Output is correct
49 Correct 121 ms 34580 KB Output is correct
50 Correct 117 ms 35316 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 2132 KB Output is correct
20 Correct 4 ms 2132 KB Output is correct
21 Correct 4 ms 2004 KB Output is correct
22 Correct 6 ms 2516 KB Output is correct
23 Correct 9 ms 3220 KB Output is correct
24 Correct 5 ms 2516 KB Output is correct
25 Correct 5 ms 2260 KB Output is correct
26 Correct 5 ms 2516 KB Output is correct
27 Correct 464 ms 111396 KB Output is correct
28 Correct 444 ms 111436 KB Output is correct
29 Correct 435 ms 111156 KB Output is correct
30 Correct 439 ms 111452 KB Output is correct
31 Correct 416 ms 63196 KB Output is correct
32 Correct 454 ms 122172 KB Output is correct
33 Correct 467 ms 114036 KB Output is correct
34 Correct 497 ms 116228 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 272 ms 51288 KB Output is correct
37 Correct 1059 ms 177180 KB Output is correct
38 Correct 1112 ms 176604 KB Output is correct
39 Correct 1407 ms 174272 KB Output is correct
40 Correct 484 ms 78896 KB Output is correct
41 Correct 160 ms 37736 KB Output is correct
42 Correct 20 ms 8172 KB Output is correct
43 Correct 1267 ms 179640 KB Output is correct
44 Correct 1946 ms 169648 KB Output is correct
45 Correct 744 ms 168304 KB Output is correct
46 Correct 399 ms 132744 KB Output is correct
47 Correct 845 ms 118456 KB Output is correct
48 Correct 429 ms 136448 KB Output is correct
49 Correct 399 ms 133848 KB Output is correct
50 Correct 715 ms 112380 KB Output is correct
51 Correct 9 ms 3864 KB Output is correct
52 Correct 11 ms 3880 KB Output is correct
53 Correct 9 ms 3828 KB Output is correct
54 Correct 14 ms 5588 KB Output is correct
55 Correct 11 ms 4840 KB Output is correct
56 Correct 10 ms 4784 KB Output is correct
57 Correct 109 ms 29052 KB Output is correct
58 Correct 117 ms 29048 KB Output is correct
59 Correct 121 ms 29056 KB Output is correct
60 Correct 163 ms 41716 KB Output is correct
61 Correct 169 ms 42188 KB Output is correct
62 Correct 181 ms 44412 KB Output is correct
63 Correct 146 ms 7540 KB Output is correct
64 Correct 143 ms 7520 KB Output is correct
65 Correct 148 ms 7464 KB Output is correct
66 Correct 148 ms 7704 KB Output is correct
67 Correct 116 ms 35948 KB Output is correct
68 Correct 113 ms 35232 KB Output is correct
69 Correct 115 ms 35824 KB Output is correct
70 Correct 130 ms 35836 KB Output is correct
71 Correct 115 ms 34992 KB Output is correct
72 Correct 114 ms 35840 KB Output is correct
73 Correct 121 ms 34580 KB Output is correct
74 Correct 117 ms 35316 KB Output is correct
75 Correct 439 ms 111200 KB Output is correct
76 Correct 458 ms 111440 KB Output is correct
77 Correct 409 ms 111440 KB Output is correct
78 Correct 452 ms 111260 KB Output is correct
79 Correct 505 ms 111984 KB Output is correct
80 Correct 430 ms 111128 KB Output is correct
81 Correct 933 ms 172084 KB Output is correct
82 Correct 849 ms 163028 KB Output is correct
83 Correct 787 ms 163300 KB Output is correct
84 Correct 1348 ms 187380 KB Output is correct
85 Correct 872 ms 169128 KB Output is correct
86 Correct 756 ms 161224 KB Output is correct
87 Execution timed out 3085 ms 227884 KB Time limit exceeded
88 Halted 0 ms 0 KB -