oj.uz

Submission #533377

# Submission time Handle Problem Language Result Execution time Memory
533377 2022-03-05T19:09:02 Z flappybird Circle selection (APIO18_circle_selection) C++17
37 / 100
 3000 ms 697232 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++) {
			int x, y;
			x = X[i] / r;
			y = Y[i] / r;
			if (R[i] < r && !e) e = i - 1;
			int xx, yy;
			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;
			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 328 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 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 2 ms 588 KB Output is correct
12 Correct 1 ms 576 KB Output is correct
13 Correct 2 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 2 ms 588 KB Output is correct
16 Correct 3 ms 496 KB Output is correct
17 Correct 3 ms 492 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 10 ms 1384 KB Output is correct
20 Correct 11 ms 1356 KB Output is correct
21 Correct 12 ms 1360 KB Output is correct
22 Correct 58 ms 11768 KB Output is correct
23 Correct 80 ms 11700 KB Output is correct
24 Correct 68 ms 11780 KB Output is correct
25 Correct 66 ms 11700 KB Output is correct
26 Correct 74 ms 11712 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 503 ms 44432 KB Output is correct
2 Correct 498 ms 48840 KB Output is correct
3 Correct 576 ms 48844 KB Output is correct
4 Correct 521 ms 48352 KB Output is correct
5 Correct 1529 ms 75988 KB Output is correct
6 Execution timed out 3033 ms 214720 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2713 ms 218596 KB Output is correct
3 Execution timed out 3119 ms 692920 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 3049 ms 697232 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 328 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 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 2 ms 588 KB Output is correct
12 Correct 1 ms 576 KB Output is correct
13 Correct 2 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 2 ms 588 KB Output is correct
16 Correct 3 ms 496 KB Output is correct
17 Correct 3 ms 492 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 10 ms 1384 KB Output is correct
20 Correct 11 ms 1356 KB Output is correct
21 Correct 12 ms 1360 KB Output is correct
22 Correct 58 ms 11768 KB Output is correct
23 Correct 80 ms 11700 KB Output is correct
24 Correct 68 ms 11780 KB Output is correct
25 Correct 66 ms 11700 KB Output is correct
26 Correct 74 ms 11712 KB Output is correct
27 Correct 22 ms 2380 KB Output is correct
28 Correct 23 ms 2428 KB Output is correct
29 Correct 22 ms 2384 KB Output is correct
30 Correct 144 ms 23216 KB Output is correct
31 Correct 208 ms 23148 KB Output is correct
32 Correct 167 ms 23232 KB Output is correct
33 Correct 217 ms 18784 KB Output is correct
34 Correct 191 ms 17224 KB Output is correct
35 Correct 223 ms 17520 KB Output is correct
36 Correct 2933 ms 224512 KB Output is correct
37 Correct 2763 ms 224544 KB Output is correct
38 Correct 2982 ms 224104 KB Output is correct
39 Correct 2037 ms 47920 KB Output is correct
40 Correct 1986 ms 48020 KB Output is correct
41 Correct 2011 ms 47896 KB Output is correct
42 Correct 557 ms 46972 KB Output is correct
43 Correct 968 ms 213536 KB Output is correct
44 Correct 966 ms 213496 KB Output is correct
45 Correct 966 ms 213444 KB Output is correct
46 Correct 1006 ms 213536 KB Output is correct
47 Correct 958 ms 213676 KB Output is correct
48 Correct 955 ms 213484 KB Output is correct
49 Correct 996 ms 213664 KB Output is correct
50 Correct 957 ms 213536 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 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 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 2 ms 588 KB Output is correct
12 Correct 1 ms 576 KB Output is correct
13 Correct 2 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 2 ms 588 KB Output is correct
16 Correct 3 ms 496 KB Output is correct
17 Correct 3 ms 492 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 10 ms 1384 KB Output is correct
20 Correct 11 ms 1356 KB Output is correct
21 Correct 12 ms 1360 KB Output is correct
22 Correct 58 ms 11768 KB Output is correct
23 Correct 80 ms 11700 KB Output is correct
24 Correct 68 ms 11780 KB Output is correct
25 Correct 66 ms 11700 KB Output is correct
26 Correct 74 ms 11712 KB Output is correct
27 Correct 503 ms 44432 KB Output is correct
28 Correct 498 ms 48840 KB Output is correct
29 Correct 576 ms 48844 KB Output is correct
30 Correct 521 ms 48352 KB Output is correct
31 Correct 1529 ms 75988 KB Output is correct
32 Execution timed out 3033 ms 214720 KB Time limit exceeded
33 Halted 0 ms 0 KB -