oj.uz

Submission #533376

# Submission time Handle Problem Language Result Execution time Memory
533376 2022-03-05T19:08:10 Z flappybird Circle selection (APIO18_circle_selection) C++17
37 / 100
 2933 ms 224812 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 201010
#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 320 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 556 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 1 ms 592 KB Output is correct
15 Correct 2 ms 592 KB Output is correct
16 Correct 3 ms 464 KB Output is correct
17 Correct 3 ms 592 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 11 ms 1392 KB Output is correct
20 Correct 12 ms 1436 KB Output is correct
21 Correct 12 ms 1488 KB Output is correct
22 Correct 61 ms 11780 KB Output is correct
23 Correct 87 ms 11756 KB Output is correct
24 Correct 75 ms 11764 KB Output is correct
25 Correct 60 ms 11708 KB Output is correct
26 Correct 83 ms 11732 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 55 ms 11552 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 2793 ms 221352 KB Output is correct
3 Runtime error 67 ms 12360 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 63 ms 12292 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 556 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 1 ms 592 KB Output is correct
15 Correct 2 ms 592 KB Output is correct
16 Correct 3 ms 464 KB Output is correct
17 Correct 3 ms 592 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 11 ms 1392 KB Output is correct
20 Correct 12 ms 1436 KB Output is correct
21 Correct 12 ms 1488 KB Output is correct
22 Correct 61 ms 11780 KB Output is correct
23 Correct 87 ms 11756 KB Output is correct
24 Correct 75 ms 11764 KB Output is correct
25 Correct 60 ms 11708 KB Output is correct
26 Correct 83 ms 11732 KB Output is correct
27 Correct 25 ms 2384 KB Output is correct
28 Correct 24 ms 2376 KB Output is correct
29 Correct 23 ms 2388 KB Output is correct
30 Correct 140 ms 23152 KB Output is correct
31 Correct 215 ms 23196 KB Output is correct
32 Correct 157 ms 23224 KB Output is correct
33 Correct 219 ms 19616 KB Output is correct
34 Correct 191 ms 18032 KB Output is correct
35 Correct 223 ms 18012 KB Output is correct
36 Correct 2933 ms 224484 KB Output is correct
37 Correct 2715 ms 224812 KB Output is correct
38 Correct 2913 ms 224488 KB Output is correct
39 Correct 1984 ms 47948 KB Output is correct
40 Correct 1993 ms 47880 KB Output is correct
41 Correct 2025 ms 48028 KB Output is correct
42 Correct 543 ms 47112 KB Output is correct
43 Correct 930 ms 213648 KB Output is correct
44 Correct 932 ms 214092 KB Output is correct
45 Correct 930 ms 213648 KB Output is correct
46 Correct 975 ms 213916 KB Output is correct
47 Correct 949 ms 213988 KB Output is correct
48 Correct 943 ms 213924 KB Output is correct
49 Correct 976 ms 214248 KB Output is correct
50 Correct 944 ms 213860 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 556 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 1 ms 592 KB Output is correct
15 Correct 2 ms 592 KB Output is correct
16 Correct 3 ms 464 KB Output is correct
17 Correct 3 ms 592 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 11 ms 1392 KB Output is correct
20 Correct 12 ms 1436 KB Output is correct
21 Correct 12 ms 1488 KB Output is correct
22 Correct 61 ms 11780 KB Output is correct
23 Correct 87 ms 11756 KB Output is correct
24 Correct 75 ms 11764 KB Output is correct
25 Correct 60 ms 11708 KB Output is correct
26 Correct 83 ms 11732 KB Output is correct
27 Runtime error 55 ms 11552 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -