oj.uz

Submission #533390

# Submission time Handle Problem Language Result Execution time Memory
533390 2022-03-05T20:55:00 Z flappybird Circle selection (APIO18_circle_selection) C++14
49 / 100
 3000 ms 591972 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#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;
}
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;
}
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] / r;
			y = Y[i] / r;
			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[trans(xx, 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)) % 2 == 0) mp[trans(xx, 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 = trans(xx, 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++) {
					ll t = trans(xx, 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 0 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 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 2 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 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 4 ms 844 KB Output is correct
21 Correct 5 ms 844 KB Output is correct
22 Correct 40 ms 6792 KB Output is correct
23 Correct 43 ms 6456 KB Output is correct
24 Correct 42 ms 6124 KB Output is correct
25 Correct 39 ms 6688 KB Output is correct
26 Correct 41 ms 6376 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 228 ms 29436 KB Output is correct
2 Correct 233 ms 29956 KB Output is correct
3 Correct 215 ms 27264 KB Output is correct
4 Correct 218 ms 27468 KB Output is correct
5 Correct 472 ms 42620 KB Output is correct
6 Correct 2496 ms 126540 KB Output is correct
7 Correct 632 ms 40224 KB Output is correct
8 Correct 1079 ms 62588 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 1918 ms 112288 KB Output is correct
3 Execution timed out 3104 ms 373496 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 3079 ms 591972 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 0 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 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 2 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 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 4 ms 844 KB Output is correct
21 Correct 5 ms 844 KB Output is correct
22 Correct 40 ms 6792 KB Output is correct
23 Correct 43 ms 6456 KB Output is correct
24 Correct 42 ms 6124 KB Output is correct
25 Correct 39 ms 6688 KB Output is correct
26 Correct 41 ms 6376 KB Output is correct
27 Correct 8 ms 1356 KB Output is correct
28 Correct 8 ms 1400 KB Output is correct
29 Correct 7 ms 1248 KB Output is correct
30 Correct 99 ms 13864 KB Output is correct
31 Correct 108 ms 13336 KB Output is correct
32 Correct 101 ms 12340 KB Output is correct
33 Correct 68 ms 8320 KB Output is correct
34 Correct 93 ms 9604 KB Output is correct
35 Correct 78 ms 9624 KB Output is correct
36 Correct 2249 ms 141532 KB Output is correct
37 Correct 1894 ms 110288 KB Output is correct
38 Correct 2290 ms 142300 KB Output is correct
39 Correct 793 ms 30996 KB Output is correct
40 Correct 799 ms 31124 KB Output is correct
41 Correct 808 ms 30968 KB Output is correct
42 Correct 520 ms 35320 KB Output is correct
43 Correct 1095 ms 187704 KB Output is correct
44 Correct 1094 ms 188064 KB Output is correct
45 Correct 1100 ms 187860 KB Output is correct
46 Correct 1160 ms 187840 KB Output is correct
47 Correct 1103 ms 188208 KB Output is correct
48 Correct 1091 ms 188168 KB Output is correct
49 Correct 1088 ms 188208 KB Output is correct
50 Correct 1112 ms 188004 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 0 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 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 2 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 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 4 ms 844 KB Output is correct
21 Correct 5 ms 844 KB Output is correct
22 Correct 40 ms 6792 KB Output is correct
23 Correct 43 ms 6456 KB Output is correct
24 Correct 42 ms 6124 KB Output is correct
25 Correct 39 ms 6688 KB Output is correct
26 Correct 41 ms 6376 KB Output is correct
27 Correct 228 ms 29436 KB Output is correct
28 Correct 233 ms 29956 KB Output is correct
29 Correct 215 ms 27264 KB Output is correct
30 Correct 218 ms 27468 KB Output is correct
31 Correct 472 ms 42620 KB Output is correct
32 Correct 2496 ms 126540 KB Output is correct
33 Correct 632 ms 40224 KB Output is correct
34 Correct 1079 ms 62588 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1918 ms 112288 KB Output is correct
37 Execution timed out 3104 ms 373496 KB Time limit exceeded
38 Halted 0 ms 0 KB -