oj.uz

Submission #533433

# Submission time Handle Problem Language Result Execution time Memory
533433 2022-03-06T03:53:49 Z flappybird Circle selection (APIO18_circle_selection) C++17
49 / 100
 3000 ms 460232 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;
}
unordered_map<ll, vector<int>> mp;
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;
		mp.clear();
		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 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 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 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 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 4 ms 976 KB Output is correct
20 Correct 4 ms 1088 KB Output is correct
21 Correct 4 ms 976 KB Output is correct
22 Correct 25 ms 6108 KB Output is correct
23 Correct 28 ms 5852 KB Output is correct
24 Correct 26 ms 5852 KB Output is correct
25 Correct 26 ms 6096 KB Output is correct
26 Correct 27 ms 5680 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 271 ms 29380 KB Output is correct
2 Correct 238 ms 30476 KB Output is correct
3 Correct 244 ms 27568 KB Output is correct
4 Correct 213 ms 27788 KB Output is correct
5 Correct 577 ms 43860 KB Output is correct
6 Correct 2263 ms 120808 KB Output is correct
7 Correct 690 ms 41744 KB Output is correct
8 Correct 1068 ms 65536 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 1485 ms 98352 KB Output is correct
3 Execution timed out 3098 ms 334480 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 3022 ms 460232 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 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 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 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 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 4 ms 976 KB Output is correct
20 Correct 4 ms 1088 KB Output is correct
21 Correct 4 ms 976 KB Output is correct
22 Correct 25 ms 6108 KB Output is correct
23 Correct 28 ms 5852 KB Output is correct
24 Correct 26 ms 5852 KB Output is correct
25 Correct 26 ms 6096 KB Output is correct
26 Correct 27 ms 5680 KB Output is correct
27 Correct 8 ms 1356 KB Output is correct
28 Correct 10 ms 1484 KB Output is correct
29 Correct 8 ms 1228 KB Output is correct
30 Correct 66 ms 12092 KB Output is correct
31 Correct 95 ms 11704 KB Output is correct
32 Correct 85 ms 11192 KB Output is correct
33 Correct 71 ms 8044 KB Output is correct
34 Correct 71 ms 9244 KB Output is correct
35 Correct 76 ms 9424 KB Output is correct
36 Correct 1512 ms 105044 KB Output is correct
37 Correct 1434 ms 101340 KB Output is correct
38 Correct 1489 ms 106480 KB Output is correct
39 Correct 795 ms 32024 KB Output is correct
40 Correct 793 ms 31840 KB Output is correct
41 Correct 821 ms 31932 KB Output is correct
42 Correct 550 ms 36516 KB Output is correct
43 Correct 1067 ms 156164 KB Output is correct
44 Correct 1184 ms 156192 KB Output is correct
45 Correct 988 ms 156068 KB Output is correct
46 Correct 1016 ms 156184 KB Output is correct
47 Correct 997 ms 156236 KB Output is correct
48 Correct 1031 ms 156192 KB Output is correct
49 Correct 1000 ms 156376 KB Output is correct
50 Correct 1014 ms 156196 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 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 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 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 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 4 ms 976 KB Output is correct
20 Correct 4 ms 1088 KB Output is correct
21 Correct 4 ms 976 KB Output is correct
22 Correct 25 ms 6108 KB Output is correct
23 Correct 28 ms 5852 KB Output is correct
24 Correct 26 ms 5852 KB Output is correct
25 Correct 26 ms 6096 KB Output is correct
26 Correct 27 ms 5680 KB Output is correct
27 Correct 271 ms 29380 KB Output is correct
28 Correct 238 ms 30476 KB Output is correct
29 Correct 244 ms 27568 KB Output is correct
30 Correct 213 ms 27788 KB Output is correct
31 Correct 577 ms 43860 KB Output is correct
32 Correct 2263 ms 120808 KB Output is correct
33 Correct 690 ms 41744 KB Output is correct
34 Correct 1068 ms 65536 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1485 ms 98352 KB Output is correct
37 Execution timed out 3098 ms 334480 KB Time limit exceeded
38 Halted 0 ms 0 KB -