oj.uz

Submission #533434

# Submission time Handle Problem Language Result Execution time Memory
533434 2022-03-06T03:54:58 Z flappybird Circle selection (APIO18_circle_selection) C++17
72 / 100
 3000 ms 460120 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;
}
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 0 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 1 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 332 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 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 844 KB Output is correct
20 Correct 5 ms 844 KB Output is correct
21 Correct 5 ms 844 KB Output is correct
22 Correct 27 ms 5980 KB Output is correct
23 Correct 30 ms 5716 KB Output is correct
24 Correct 27 ms 5684 KB Output is correct
25 Correct 29 ms 5972 KB Output is correct
26 Correct 28 ms 5596 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 28960 KB Output is correct
2 Correct 247 ms 29916 KB Output is correct
3 Correct 221 ms 27172 KB Output is correct
4 Correct 226 ms 27280 KB Output is correct
5 Correct 515 ms 43320 KB Output is correct
6 Correct 2203 ms 120192 KB Output is correct
7 Correct 660 ms 41472 KB Output is correct
8 Correct 1037 ms 65252 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 1440 ms 98036 KB Output is correct
3 Execution timed out 3097 ms 333852 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2899 ms 460120 KB Output is correct
2 Correct 1439 ms 248420 KB Output is correct
3 Correct 1324 ms 71540 KB Output is correct
4 Correct 2901 ms 459940 KB Output is correct
5 Correct 2900 ms 459928 KB Output is correct
6 Correct 583 ms 55196 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 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 332 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 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 844 KB Output is correct
20 Correct 5 ms 844 KB Output is correct
21 Correct 5 ms 844 KB Output is correct
22 Correct 27 ms 5980 KB Output is correct
23 Correct 30 ms 5716 KB Output is correct
24 Correct 27 ms 5684 KB Output is correct
25 Correct 29 ms 5972 KB Output is correct
26 Correct 28 ms 5596 KB Output is correct
27 Correct 8 ms 1304 KB Output is correct
28 Correct 8 ms 1444 KB Output is correct
29 Correct 7 ms 1228 KB Output is correct
30 Correct 66 ms 12080 KB Output is correct
31 Correct 79 ms 11716 KB Output is correct
32 Correct 70 ms 11256 KB Output is correct
33 Correct 68 ms 8088 KB Output is correct
34 Correct 78 ms 9368 KB Output is correct
35 Correct 87 ms 9412 KB Output is correct
36 Correct 1473 ms 104864 KB Output is correct
37 Correct 1350 ms 101336 KB Output is correct
38 Correct 1456 ms 106432 KB Output is correct
39 Correct 742 ms 31948 KB Output is correct
40 Correct 737 ms 31896 KB Output is correct
41 Correct 741 ms 31960 KB Output is correct
42 Correct 505 ms 36332 KB Output is correct
43 Correct 966 ms 156128 KB Output is correct
44 Correct 1126 ms 156264 KB Output is correct
45 Correct 970 ms 156068 KB Output is correct
46 Correct 985 ms 156124 KB Output is correct
47 Correct 959 ms 156284 KB Output is correct
48 Correct 977 ms 156240 KB Output is correct
49 Correct 963 ms 156476 KB Output is correct
50 Correct 975 ms 156264 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 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 332 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 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 844 KB Output is correct
20 Correct 5 ms 844 KB Output is correct
21 Correct 5 ms 844 KB Output is correct
22 Correct 27 ms 5980 KB Output is correct
23 Correct 30 ms 5716 KB Output is correct
24 Correct 27 ms 5684 KB Output is correct
25 Correct 29 ms 5972 KB Output is correct
26 Correct 28 ms 5596 KB Output is correct
27 Correct 223 ms 28960 KB Output is correct
28 Correct 247 ms 29916 KB Output is correct
29 Correct 221 ms 27172 KB Output is correct
30 Correct 226 ms 27280 KB Output is correct
31 Correct 515 ms 43320 KB Output is correct
32 Correct 2203 ms 120192 KB Output is correct
33 Correct 660 ms 41472 KB Output is correct
34 Correct 1037 ms 65252 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1440 ms 98036 KB Output is correct
37 Execution timed out 3097 ms 333852 KB Time limit exceeded
38 Halted 0 ms 0 KB -