oj.uz

Submission #533431

# Submission time Handle Problem Language Result Execution time Memory
533431 2022-03-06T03:47:02 Z flappybird Circle selection (APIO18_circle_selection) C++14
49 / 100
 3000 ms 459224 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];
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) continue;
		unordered_map<ll, vector<int>> mp;
		e = 0;
		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 && !e) e = i - 1;
			int xx, yy;
			if (R[i] <= r) {
				for (xx = x - 1; xx <= x + 1; xx++) for (yy = y - 1; yy <= y + 1; yy++) mp[((ll)xx << 31LL) + yy].push_back(i);
			}
			else {
				for (xx = x - 2; xx <= x + 2; xx++) for (yy = y - 2; yy <= y + 2; yy++) if (!(max(abs(x - xx), abs(y - yy)) & 1)) mp[((ll)xx << 31LL) + yy].push_back(i);
			}
		}
		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;
			if (R[i] <= r) {
				for (xx = x - 1; xx <= x + 1; xx++) for (yy = y - 1; yy <= y + 1; yy++) {
					ll t = ((ll)xx << 31LL) + yy;
					for (auto c : mp[t]) if (!ans[c] && chk(c, i)) ans[c] = i;
				}
			}
			else {
				for (xx = x - 2; xx <= x + 2; xx++) for (yy = y - 2; yy <= y + 2; yy++) {
					if (max(abs(x - xx), abs(y - yy)) & 1) continue;
					ll t = ((ll)xx << 31LL) + yy;
					for (auto c : mp[t]) if (!ans[c] && chk(c, i)) ans[c] = i;
				}
			}
		}
	}
	for (i = 1; i <= N; i++) ri[ind[i]] = i;
	for (i = 1; i <= N; i++) cout << ind[ans[ri[i]]] << bb;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 2 ms 448 KB Output is correct
12 Correct 1 ms 444 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 444 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 5 ms 956 KB Output is correct
20 Correct 5 ms 1100 KB Output is correct
21 Correct 5 ms 972 KB Output is correct
22 Correct 36 ms 6072 KB Output is correct
23 Correct 38 ms 5844 KB Output is correct
24 Correct 37 ms 5724 KB Output is correct
25 Correct 35 ms 6056 KB Output is correct
26 Correct 38 ms 5688 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 250 ms 31020 KB Output is correct
2 Correct 247 ms 31192 KB Output is correct
3 Correct 257 ms 28332 KB Output is correct
4 Correct 225 ms 28384 KB Output is correct
5 Correct 623 ms 43684 KB Output is correct
6 Correct 2436 ms 127004 KB Output is correct
7 Correct 656 ms 40640 KB Output is correct
8 Correct 1196 ms 63052 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1799 ms 98504 KB Output is correct
3 Execution timed out 3090 ms 335704 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3031 ms 459224 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 2 ms 448 KB Output is correct
12 Correct 1 ms 444 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 444 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 5 ms 956 KB Output is correct
20 Correct 5 ms 1100 KB Output is correct
21 Correct 5 ms 972 KB Output is correct
22 Correct 36 ms 6072 KB Output is correct
23 Correct 38 ms 5844 KB Output is correct
24 Correct 37 ms 5724 KB Output is correct
25 Correct 35 ms 6056 KB Output is correct
26 Correct 38 ms 5688 KB Output is correct
27 Correct 9 ms 1604 KB Output is correct
28 Correct 9 ms 1768 KB Output is correct
29 Correct 9 ms 1612 KB Output is correct
30 Correct 80 ms 12220 KB Output is correct
31 Correct 108 ms 11932 KB Output is correct
32 Correct 124 ms 11372 KB Output is correct
33 Correct 73 ms 10116 KB Output is correct
34 Correct 78 ms 11392 KB Output is correct
35 Correct 91 ms 11428 KB Output is correct
36 Correct 1996 ms 105440 KB Output is correct
37 Correct 1913 ms 103020 KB Output is correct
38 Correct 2054 ms 107064 KB Output is correct
39 Correct 851 ms 32000 KB Output is correct
40 Correct 824 ms 32028 KB Output is correct
41 Correct 822 ms 32060 KB Output is correct
42 Correct 554 ms 36928 KB Output is correct
43 Correct 1062 ms 156860 KB Output is correct
44 Correct 1226 ms 157012 KB Output is correct
45 Correct 1063 ms 156908 KB Output is correct
46 Correct 1029 ms 156884 KB Output is correct
47 Correct 1014 ms 157008 KB Output is correct
48 Correct 1018 ms 156964 KB Output is correct
49 Correct 1047 ms 157220 KB Output is correct
50 Correct 1025 ms 157256 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 2 ms 448 KB Output is correct
12 Correct 1 ms 444 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 444 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 5 ms 956 KB Output is correct
20 Correct 5 ms 1100 KB Output is correct
21 Correct 5 ms 972 KB Output is correct
22 Correct 36 ms 6072 KB Output is correct
23 Correct 38 ms 5844 KB Output is correct
24 Correct 37 ms 5724 KB Output is correct
25 Correct 35 ms 6056 KB Output is correct
26 Correct 38 ms 5688 KB Output is correct
27 Correct 250 ms 31020 KB Output is correct
28 Correct 247 ms 31192 KB Output is correct
29 Correct 257 ms 28332 KB Output is correct
30 Correct 225 ms 28384 KB Output is correct
31 Correct 623 ms 43684 KB Output is correct
32 Correct 2436 ms 127004 KB Output is correct
33 Correct 656 ms 40640 KB Output is correct
34 Correct 1196 ms 63052 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1799 ms 98504 KB Output is correct
37 Execution timed out 3090 ms 335704 KB Time limit exceeded
38 Halted 0 ms 0 KB -