oj.uz

Submission #533396

# Submission time Handle Problem Language Result Execution time Memory
533396 2022-03-05T21:10:04 Z flappybird Circle selection (APIO18_circle_selection) C++14
49 / 100
 3000 ms 569228 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;
}
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;
		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[((ll)xx * (ll)INF) + 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 * (ll)INF) + 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 * (ll)INF) + 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 * (ll)INF) + 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 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 0 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 2 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 2 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 6 ms 844 KB Output is correct
20 Correct 5 ms 892 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 42 ms 7244 KB Output is correct
23 Correct 53 ms 6912 KB Output is correct
24 Correct 46 ms 6760 KB Output is correct
25 Correct 40 ms 7188 KB Output is correct
26 Correct 45 ms 6648 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 28976 KB Output is correct
2 Correct 202 ms 29856 KB Output is correct
3 Correct 188 ms 27104 KB Output is correct
4 Correct 208 ms 27444 KB Output is correct
5 Correct 681 ms 41304 KB Output is correct
6 Correct 2685 ms 144728 KB Output is correct
7 Correct 867 ms 43148 KB Output is correct
8 Correct 1447 ms 73024 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 2301 ms 119428 KB Output is correct
3 Execution timed out 3084 ms 397740 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 3080 ms 569228 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 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 2 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 2 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 6 ms 844 KB Output is correct
20 Correct 5 ms 892 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 42 ms 7244 KB Output is correct
23 Correct 53 ms 6912 KB Output is correct
24 Correct 46 ms 6760 KB Output is correct
25 Correct 40 ms 7188 KB Output is correct
26 Correct 45 ms 6648 KB Output is correct
27 Correct 7 ms 1356 KB Output is correct
28 Correct 8 ms 1484 KB Output is correct
29 Correct 8 ms 1288 KB Output is correct
30 Correct 117 ms 14752 KB Output is correct
31 Correct 140 ms 14176 KB Output is correct
32 Correct 103 ms 13584 KB Output is correct
33 Correct 67 ms 7984 KB Output is correct
34 Correct 69 ms 9260 KB Output is correct
35 Correct 81 ms 9368 KB Output is correct
36 Correct 2103 ms 129076 KB Output is correct
37 Correct 1887 ms 124144 KB Output is correct
38 Correct 2327 ms 131216 KB Output is correct
39 Correct 796 ms 38492 KB Output is correct
40 Correct 878 ms 38508 KB Output is correct
41 Correct 803 ms 38424 KB Output is correct
42 Correct 779 ms 41340 KB Output is correct
43 Correct 960 ms 184412 KB Output is correct
44 Correct 932 ms 184544 KB Output is correct
45 Correct 969 ms 184476 KB Output is correct
46 Correct 934 ms 184444 KB Output is correct
47 Correct 955 ms 184648 KB Output is correct
48 Correct 919 ms 184524 KB Output is correct
49 Correct 959 ms 184648 KB Output is correct
50 Correct 920 ms 184648 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 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 0 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 2 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 2 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 6 ms 844 KB Output is correct
20 Correct 5 ms 892 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 42 ms 7244 KB Output is correct
23 Correct 53 ms 6912 KB Output is correct
24 Correct 46 ms 6760 KB Output is correct
25 Correct 40 ms 7188 KB Output is correct
26 Correct 45 ms 6648 KB Output is correct
27 Correct 258 ms 28976 KB Output is correct
28 Correct 202 ms 29856 KB Output is correct
29 Correct 188 ms 27104 KB Output is correct
30 Correct 208 ms 27444 KB Output is correct
31 Correct 681 ms 41304 KB Output is correct
32 Correct 2685 ms 144728 KB Output is correct
33 Correct 867 ms 43148 KB Output is correct
34 Correct 1447 ms 73024 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 2301 ms 119428 KB Output is correct
37 Execution timed out 3084 ms 397740 KB Time limit exceeded
38 Halted 0 ms 0 KB -