oj.uz

Submission #533432

# Submission time Handle Problem Language Result Execution time Memory
533432 2022-03-06T03:49:10 Z flappybird Circle selection (APIO18_circle_selection) C++14
72 / 100
 3000 ms 458292 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) 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 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 328 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 332 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 456 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 460 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 4 ms 972 KB Output is correct
20 Correct 4 ms 1112 KB Output is correct
21 Correct 5 ms 972 KB Output is correct
22 Correct 32 ms 6044 KB Output is correct
23 Correct 37 ms 5800 KB Output is correct
24 Correct 34 ms 5740 KB Output is correct
25 Correct 35 ms 5980 KB Output is correct
26 Correct 36 ms 5688 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 229 ms 31420 KB Output is correct
2 Correct 232 ms 31968 KB Output is correct
3 Correct 233 ms 29180 KB Output is correct
4 Correct 230 ms 29384 KB Output is correct
5 Correct 565 ms 44732 KB Output is correct
6 Correct 2339 ms 127916 KB Output is correct
7 Correct 628 ms 41392 KB Output is correct
8 Correct 1040 ms 63708 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 1723 ms 98536 KB Output is correct
3 Execution timed out 3059 ms 336160 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2891 ms 457336 KB Output is correct
2 Correct 1447 ms 246664 KB Output is correct
3 Correct 1365 ms 70276 KB Output is correct
4 Correct 2963 ms 458200 KB Output is correct
5 Correct 2955 ms 458292 KB Output is correct
6 Correct 672 ms 54464 KB Output is correct

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 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 328 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 332 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 456 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 460 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 4 ms 972 KB Output is correct
20 Correct 4 ms 1112 KB Output is correct
21 Correct 5 ms 972 KB Output is correct
22 Correct 32 ms 6044 KB Output is correct
23 Correct 37 ms 5800 KB Output is correct
24 Correct 34 ms 5740 KB Output is correct
25 Correct 35 ms 5980 KB Output is correct
26 Correct 36 ms 5688 KB Output is correct
27 Correct 8 ms 1484 KB Output is correct
28 Correct 9 ms 1536 KB Output is correct
29 Correct 7 ms 1412 KB Output is correct
30 Correct 79 ms 12192 KB Output is correct
31 Correct 96 ms 11752 KB Output is correct
32 Correct 97 ms 11384 KB Output is correct
33 Correct 72 ms 8344 KB Output is correct
34 Correct 74 ms 9596 KB Output is correct
35 Correct 79 ms 9700 KB Output is correct
36 Correct 1785 ms 104152 KB Output is correct
37 Correct 1713 ms 101704 KB Output is correct
38 Correct 1785 ms 105764 KB Output is correct
39 Correct 768 ms 31092 KB Output is correct
40 Correct 781 ms 31240 KB Output is correct
41 Correct 784 ms 31344 KB Output is correct
42 Correct 489 ms 35584 KB Output is correct
43 Correct 974 ms 155548 KB Output is correct
44 Correct 1132 ms 155484 KB Output is correct
45 Correct 968 ms 155420 KB Output is correct
46 Correct 969 ms 155408 KB Output is correct
47 Correct 975 ms 155668 KB Output is correct
48 Correct 979 ms 155544 KB Output is correct
49 Correct 989 ms 155692 KB Output is correct
50 Correct 979 ms 155472 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 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 328 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 332 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 456 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 460 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 4 ms 972 KB Output is correct
20 Correct 4 ms 1112 KB Output is correct
21 Correct 5 ms 972 KB Output is correct
22 Correct 32 ms 6044 KB Output is correct
23 Correct 37 ms 5800 KB Output is correct
24 Correct 34 ms 5740 KB Output is correct
25 Correct 35 ms 5980 KB Output is correct
26 Correct 36 ms 5688 KB Output is correct
27 Correct 229 ms 31420 KB Output is correct
28 Correct 232 ms 31968 KB Output is correct
29 Correct 233 ms 29180 KB Output is correct
30 Correct 230 ms 29384 KB Output is correct
31 Correct 565 ms 44732 KB Output is correct
32 Correct 2339 ms 127916 KB Output is correct
33 Correct 628 ms 41392 KB Output is correct
34 Correct 1040 ms 63708 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1723 ms 98536 KB Output is correct
37 Execution timed out 3059 ms 336160 KB Time limit exceeded
38 Halted 0 ms 0 KB -