oj.uz

Submission #533380

# Submission time Handle Problem Language Result Execution time Memory
533380 2022-03-05T19:17:43 Z flappybird Circle selection (APIO18_circle_selection) C++17
49 / 100
 3000 ms 693288 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++) 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 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 2 ms 548 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 5 ms 972 KB Output is correct
20 Correct 5 ms 1228 KB Output is correct
21 Correct 5 ms 1044 KB Output is correct
22 Correct 40 ms 7388 KB Output is correct
23 Correct 43 ms 7232 KB Output is correct
24 Correct 38 ms 6720 KB Output is correct
25 Correct 40 ms 7260 KB Output is correct
26 Correct 41 ms 6968 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 31888 KB Output is correct
2 Correct 264 ms 33108 KB Output is correct
3 Correct 244 ms 28920 KB Output is correct
4 Correct 242 ms 30484 KB Output is correct
5 Correct 441 ms 45644 KB Output is correct
6 Correct 2161 ms 128320 KB Output is correct
7 Correct 541 ms 47460 KB Output is correct
8 Correct 965 ms 75084 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 1684 ms 122356 KB Output is correct
3 Execution timed out 3072 ms 400188 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 3096 ms 693288 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 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 2 ms 548 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 5 ms 972 KB Output is correct
20 Correct 5 ms 1228 KB Output is correct
21 Correct 5 ms 1044 KB Output is correct
22 Correct 40 ms 7388 KB Output is correct
23 Correct 43 ms 7232 KB Output is correct
24 Correct 38 ms 6720 KB Output is correct
25 Correct 40 ms 7260 KB Output is correct
26 Correct 41 ms 6968 KB Output is correct
27 Correct 8 ms 1356 KB Output is correct
28 Correct 9 ms 1620 KB Output is correct
29 Correct 8 ms 1484 KB Output is correct
30 Correct 94 ms 14980 KB Output is correct
31 Correct 107 ms 14624 KB Output is correct
32 Correct 111 ms 13244 KB Output is correct
33 Correct 73 ms 8168 KB Output is correct
34 Correct 80 ms 10432 KB Output is correct
35 Correct 83 ms 10068 KB Output is correct
36 Correct 2011 ms 151240 KB Output is correct
37 Correct 1665 ms 116516 KB Output is correct
38 Correct 1973 ms 151404 KB Output is correct
39 Correct 791 ms 31024 KB Output is correct
40 Correct 801 ms 30964 KB Output is correct
41 Correct 802 ms 31092 KB Output is correct
42 Correct 554 ms 45400 KB Output is correct
43 Correct 986 ms 211244 KB Output is correct
44 Correct 974 ms 211372 KB Output is correct
45 Correct 965 ms 211252 KB Output is correct
46 Correct 1010 ms 211272 KB Output is correct
47 Correct 949 ms 211360 KB Output is correct
48 Correct 957 ms 211280 KB Output is correct
49 Correct 958 ms 211520 KB Output is correct
50 Correct 987 ms 211312 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 2 ms 548 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 5 ms 972 KB Output is correct
20 Correct 5 ms 1228 KB Output is correct
21 Correct 5 ms 1044 KB Output is correct
22 Correct 40 ms 7388 KB Output is correct
23 Correct 43 ms 7232 KB Output is correct
24 Correct 38 ms 6720 KB Output is correct
25 Correct 40 ms 7260 KB Output is correct
26 Correct 41 ms 6968 KB Output is correct
27 Correct 255 ms 31888 KB Output is correct
28 Correct 264 ms 33108 KB Output is correct
29 Correct 244 ms 28920 KB Output is correct
30 Correct 242 ms 30484 KB Output is correct
31 Correct 441 ms 45644 KB Output is correct
32 Correct 2161 ms 128320 KB Output is correct
33 Correct 541 ms 47460 KB Output is correct
34 Correct 965 ms 75084 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1684 ms 122356 KB Output is correct
37 Execution timed out 3072 ms 400188 KB Time limit exceeded
38 Halted 0 ms 0 KB -