oj.uz

Submission #533436

# Submission time Handle Problem Language Result Execution time Memory
533436 2022-03-06T03:56:38 Z flappybird Circle selection (APIO18_circle_selection) C++11
49 / 100
 3000 ms 459860 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 1 ms 332 KB Output is correct
2 Correct 4 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 2 ms 460 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 5 ms 900 KB Output is correct
20 Correct 6 ms 940 KB Output is correct
21 Correct 5 ms 844 KB Output is correct
22 Correct 33 ms 6016 KB Output is correct
23 Correct 32 ms 5700 KB Output is correct
24 Correct 33 ms 5644 KB Output is correct
25 Correct 30 ms 5968 KB Output is correct
26 Correct 51 ms 5544 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 28888 KB Output is correct
2 Correct 258 ms 30020 KB Output is correct
3 Correct 236 ms 27084 KB Output is correct
4 Correct 243 ms 27316 KB Output is correct
5 Correct 658 ms 43328 KB Output is correct
6 Correct 2325 ms 120216 KB Output is correct
7 Correct 785 ms 41420 KB Output is correct
8 Correct 1132 ms 65276 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 1613 ms 97932 KB Output is correct
3 Execution timed out 3091 ms 333848 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 3075 ms 459860 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 4 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 2 ms 460 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 5 ms 900 KB Output is correct
20 Correct 6 ms 940 KB Output is correct
21 Correct 5 ms 844 KB Output is correct
22 Correct 33 ms 6016 KB Output is correct
23 Correct 32 ms 5700 KB Output is correct
24 Correct 33 ms 5644 KB Output is correct
25 Correct 30 ms 5968 KB Output is correct
26 Correct 51 ms 5544 KB Output is correct
27 Correct 9 ms 1356 KB Output is correct
28 Correct 8 ms 1356 KB Output is correct
29 Correct 8 ms 1228 KB Output is correct
30 Correct 84 ms 12076 KB Output is correct
31 Correct 83 ms 11728 KB Output is correct
32 Correct 75 ms 11224 KB Output is correct
33 Correct 88 ms 8052 KB Output is correct
34 Correct 74 ms 9252 KB Output is correct
35 Correct 80 ms 9380 KB Output is correct
36 Correct 1538 ms 104852 KB Output is correct
37 Correct 1518 ms 101368 KB Output is correct
38 Correct 1594 ms 106412 KB Output is correct
39 Correct 806 ms 31876 KB Output is correct
40 Correct 799 ms 31892 KB Output is correct
41 Correct 747 ms 31888 KB Output is correct
42 Correct 619 ms 36348 KB Output is correct
43 Correct 1006 ms 156108 KB Output is correct
44 Correct 1179 ms 156256 KB Output is correct
45 Correct 985 ms 156124 KB Output is correct
46 Correct 1018 ms 156136 KB Output is correct
47 Correct 1039 ms 156228 KB Output is correct
48 Correct 1035 ms 156176 KB Output is correct
49 Correct 1020 ms 156268 KB Output is correct
50 Correct 1069 ms 156204 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 4 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 2 ms 460 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 5 ms 900 KB Output is correct
20 Correct 6 ms 940 KB Output is correct
21 Correct 5 ms 844 KB Output is correct
22 Correct 33 ms 6016 KB Output is correct
23 Correct 32 ms 5700 KB Output is correct
24 Correct 33 ms 5644 KB Output is correct
25 Correct 30 ms 5968 KB Output is correct
26 Correct 51 ms 5544 KB Output is correct
27 Correct 252 ms 28888 KB Output is correct
28 Correct 258 ms 30020 KB Output is correct
29 Correct 236 ms 27084 KB Output is correct
30 Correct 243 ms 27316 KB Output is correct
31 Correct 658 ms 43328 KB Output is correct
32 Correct 2325 ms 120216 KB Output is correct
33 Correct 785 ms 41420 KB Output is correct
34 Correct 1132 ms 65276 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1613 ms 97932 KB Output is correct
37 Execution timed out 3091 ms 333848 KB Time limit exceeded
38 Halted 0 ms 0 KB -