oj.uz

답안 #533698

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533698 2022-03-07T01:00:05 Z flappybird 원 고르기 (APIO18_circle_selection) C++14
100 / 100
 1180 ms 31212 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O0")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pi;
#define MAX 301010
#define MAXS 20
#define INF 1000000010
#define bb ' '
#define ln '\n'
#define Ln '\n'
pair<pi, pi> in[MAX];
int X[MAX];
int Y[MAX];
int R[MAX];
int ind[MAX];
int ri[MAX];
int ans[MAX];
inline ll sq(ll x) {
	return x * x;
}
inline bool chk(int i, int j) {
	return sq(X[i] - X[j]) + sq(Y[i] - Y[j]) <= sq(R[i] + R[j]);
}
bool isrange(int x, int y) {
	if (x < 0 || y < 0) return false;
	return true;
}
inline ll trans(int x, int y) {
	return ((ll)x * (ll)INF) + y;
}
bool cmp(pair<pi, pi>& p1, pair<pi, pi>& p2) {
	if (p1.first.first == p2.first.first) return p1.first.second < p2.first.second;
	else return p1.first.first > p2.first.first;
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int N;
	cin >> N;
	int i;
	for (i = 1; i <= N; i++) cin >> in[i].second.first >> in[i].second.second >> in[i].first.first, in[i].first.second = i;
	sort(in + 1, in + N + 1, cmp);
	for (i = 1; i <= N; i++) tie(X[i], Y[i], R[i], ind[i]) = make_tuple(in[i].second.first + INF, in[i].second.second + INF, in[i].first.first, in[i].first.second);
	int k;
	int s, e;
	e = 0;
	for (k = 30; k >= 0; k--) {
		int r = 1 << k;
		s = e + 1;
		if (R[s] < r / 2) continue;
		e = 0;
		vector<pair<ll, int>> vall;
		for (i = s; i <= N; i++) {
			if (ans[i]) continue;
			int x, y;
			x = X[i] >> k;
			y = Y[i] >> k;
			if (R[i] < r / 2 && !e) e = i - 1;
			int xx, yy;
			vall.emplace_back(((ll)x << 31LL) + y, i);
		}
		sort(vall.begin(), vall.end());
		if (e == 0) e = N;
		for (i = s; i <= e; i++) {
			if (ans[i]) continue;
			ans[i] = i;
			int x, y;
			x = X[i] / r;
			y = Y[i] / r;
			int xx, yy;
			for (xx = x - 2; xx <= x + 2; xx++) for (yy = y - 2; yy <= y + 2; yy++) {
				ll t = ((ll)xx << 31LL) + yy;
				int ind = lower_bound(vall.begin(), vall.end(), make_pair(t, 0)) - vall.begin();
				while (ind < vall.size() && vall[ind].first == t) {
					if (ans[vall[ind].second]) {
						ind++;
						continue;
					}
					if (chk(vall[ind].second, i)) ans[vall[ind].second] = i;
					ind++;
				}
			}
		}
	}
	for (i = 1; i <= N; i++) ri[ind[i]] = i;
	for (i = 1; i <= N; i++) cout << ind[ans[ri[i]]] << bb;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:63:8: warning: unused variable 'xx' [-Wunused-variable]
   63 |    int xx, yy;
      |        ^~
circle_selection.cpp:63:12: warning: unused variable 'yy' [-Wunused-variable]
   63 |    int xx, yy;
      |            ^~
circle_selection.cpp:78:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     while (ind < vall.size() && vall[ind].first == t) {
      |            ~~~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 3 ms 844 KB Output is correct
20 Correct 3 ms 836 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 8 ms 844 KB Output is correct
23 Correct 10 ms 844 KB Output is correct
24 Correct 8 ms 844 KB Output is correct
25 Correct 8 ms 844 KB Output is correct
26 Correct 9 ms 844 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 183 ms 24732 KB Output is correct
2 Correct 172 ms 24632 KB Output is correct
3 Correct 184 ms 24828 KB Output is correct
4 Correct 167 ms 24760 KB Output is correct
5 Correct 189 ms 22792 KB Output is correct
6 Correct 332 ms 22688 KB Output is correct
7 Correct 207 ms 22900 KB Output is correct
8 Correct 223 ms 22668 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 229 ms 9856 KB Output is correct
3 Correct 701 ms 29392 KB Output is correct
4 Correct 700 ms 26068 KB Output is correct
5 Correct 620 ms 28192 KB Output is correct
6 Correct 266 ms 16684 KB Output is correct
7 Correct 123 ms 8632 KB Output is correct
8 Correct 21 ms 2000 KB Output is correct
9 Correct 709 ms 28392 KB Output is correct
10 Correct 560 ms 28600 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 709 ms 25916 KB Output is correct
2 Correct 536 ms 22940 KB Output is correct
3 Correct 241 ms 23024 KB Output is correct
4 Correct 562 ms 23000 KB Output is correct
5 Correct 562 ms 23264 KB Output is correct
6 Correct 197 ms 23148 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 3 ms 844 KB Output is correct
20 Correct 3 ms 836 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 8 ms 844 KB Output is correct
23 Correct 10 ms 844 KB Output is correct
24 Correct 8 ms 844 KB Output is correct
25 Correct 8 ms 844 KB Output is correct
26 Correct 9 ms 844 KB Output is correct
27 Correct 6 ms 1356 KB Output is correct
28 Correct 6 ms 1224 KB Output is correct
29 Correct 6 ms 1356 KB Output is correct
30 Correct 18 ms 1228 KB Output is correct
31 Correct 18 ms 1328 KB Output is correct
32 Correct 22 ms 1284 KB Output is correct
33 Correct 53 ms 8676 KB Output is correct
34 Correct 55 ms 8648 KB Output is correct
35 Correct 59 ms 8584 KB Output is correct
36 Correct 207 ms 9576 KB Output is correct
37 Correct 199 ms 9516 KB Output is correct
38 Correct 216 ms 10024 KB Output is correct
39 Correct 361 ms 8452 KB Output is correct
40 Correct 369 ms 8560 KB Output is correct
41 Correct 364 ms 8516 KB Output is correct
42 Correct 98 ms 7172 KB Output is correct
43 Correct 157 ms 8236 KB Output is correct
44 Correct 164 ms 8252 KB Output is correct
45 Correct 166 ms 8232 KB Output is correct
46 Correct 155 ms 8236 KB Output is correct
47 Correct 160 ms 8256 KB Output is correct
48 Correct 168 ms 8356 KB Output is correct
49 Correct 158 ms 8236 KB Output is correct
50 Correct 158 ms 8268 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 3 ms 844 KB Output is correct
20 Correct 3 ms 836 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 8 ms 844 KB Output is correct
23 Correct 10 ms 844 KB Output is correct
24 Correct 8 ms 844 KB Output is correct
25 Correct 8 ms 844 KB Output is correct
26 Correct 9 ms 844 KB Output is correct
27 Correct 183 ms 24732 KB Output is correct
28 Correct 172 ms 24632 KB Output is correct
29 Correct 184 ms 24828 KB Output is correct
30 Correct 167 ms 24760 KB Output is correct
31 Correct 189 ms 22792 KB Output is correct
32 Correct 332 ms 22688 KB Output is correct
33 Correct 207 ms 22900 KB Output is correct
34 Correct 223 ms 22668 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 229 ms 9856 KB Output is correct
37 Correct 701 ms 29392 KB Output is correct
38 Correct 700 ms 26068 KB Output is correct
39 Correct 620 ms 28192 KB Output is correct
40 Correct 266 ms 16684 KB Output is correct
41 Correct 123 ms 8632 KB Output is correct
42 Correct 21 ms 2000 KB Output is correct
43 Correct 709 ms 28392 KB Output is correct
44 Correct 560 ms 28600 KB Output is correct
45 Correct 709 ms 25916 KB Output is correct
46 Correct 536 ms 22940 KB Output is correct
47 Correct 241 ms 23024 KB Output is correct
48 Correct 562 ms 23000 KB Output is correct
49 Correct 562 ms 23264 KB Output is correct
50 Correct 197 ms 23148 KB Output is correct
51 Correct 6 ms 1356 KB Output is correct
52 Correct 6 ms 1224 KB Output is correct
53 Correct 6 ms 1356 KB Output is correct
54 Correct 18 ms 1228 KB Output is correct
55 Correct 18 ms 1328 KB Output is correct
56 Correct 22 ms 1284 KB Output is correct
57 Correct 53 ms 8676 KB Output is correct
58 Correct 55 ms 8648 KB Output is correct
59 Correct 59 ms 8584 KB Output is correct
60 Correct 207 ms 9576 KB Output is correct
61 Correct 199 ms 9516 KB Output is correct
62 Correct 216 ms 10024 KB Output is correct
63 Correct 361 ms 8452 KB Output is correct
64 Correct 369 ms 8560 KB Output is correct
65 Correct 364 ms 8516 KB Output is correct
66 Correct 98 ms 7172 KB Output is correct
67 Correct 157 ms 8236 KB Output is correct
68 Correct 164 ms 8252 KB Output is correct
69 Correct 166 ms 8232 KB Output is correct
70 Correct 155 ms 8236 KB Output is correct
71 Correct 160 ms 8256 KB Output is correct
72 Correct 168 ms 8356 KB Output is correct
73 Correct 158 ms 8236 KB Output is correct
74 Correct 158 ms 8268 KB Output is correct
75 Correct 202 ms 27356 KB Output is correct
76 Correct 188 ms 26716 KB Output is correct
77 Correct 180 ms 26944 KB Output is correct
78 Correct 175 ms 26976 KB Output is correct
79 Correct 219 ms 26748 KB Output is correct
80 Correct 169 ms 27068 KB Output is correct
81 Correct 685 ms 31212 KB Output is correct
82 Correct 655 ms 28644 KB Output is correct
83 Correct 660 ms 29128 KB Output is correct
84 Correct 683 ms 29612 KB Output is correct
85 Correct 666 ms 28860 KB Output is correct
86 Correct 650 ms 28620 KB Output is correct
87 Correct 751 ms 29188 KB Output is correct
88 Correct 1156 ms 27244 KB Output is correct
89 Correct 1127 ms 27204 KB Output is correct
90 Correct 1173 ms 27264 KB Output is correct
91 Correct 1180 ms 27224 KB Output is correct
92 Correct 1178 ms 27172 KB Output is correct
93 Correct 553 ms 28484 KB Output is correct
94 Correct 574 ms 27960 KB Output is correct
95 Correct 560 ms 28720 KB Output is correct
96 Correct 584 ms 30524 KB Output is correct
97 Correct 784 ms 27500 KB Output is correct
98 Correct 372 ms 25340 KB Output is correct
99 Correct 576 ms 28352 KB Output is correct
100 Correct 548 ms 28440 KB Output is correct
101 Correct 483 ms 25280 KB Output is correct
102 Correct 545 ms 27688 KB Output is correct
103 Correct 753 ms 30436 KB Output is correct
104 Correct 572 ms 27504 KB Output is correct
105 Correct 337 ms 22964 KB Output is correct
106 Correct 486 ms 25788 KB Output is correct
107 Correct 484 ms 25764 KB Output is correct
108 Correct 480 ms 25784 KB Output is correct
109 Correct 486 ms 25752 KB Output is correct
110 Correct 474 ms 25832 KB Output is correct
111 Correct 484 ms 25956 KB Output is correct
112 Correct 484 ms 25724 KB Output is correct
113 Correct 482 ms 25788 KB Output is correct
114 Correct 482 ms 25784 KB Output is correct
115 Correct 476 ms 25796 KB Output is correct
116 Correct 461 ms 25784 KB Output is correct