oj.uz

답안 #533394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533394 2022-03-05T21:06:32 Z flappybird 원 고르기 (APIO18_circle_selection) C++14
72 / 100
 3000 ms 464436 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];
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;
		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[((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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 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 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 476 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 4 ms 844 KB Output is correct
20 Correct 4 ms 844 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 36 ms 5980 KB Output is correct
23 Correct 39 ms 5728 KB Output is correct
24 Correct 41 ms 5596 KB Output is correct
25 Correct 33 ms 5852 KB Output is correct
26 Correct 38 ms 5524 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 28984 KB Output is correct
2 Correct 265 ms 29952 KB Output is correct
3 Correct 216 ms 27124 KB Output is correct
4 Correct 228 ms 27272 KB Output is correct
5 Correct 493 ms 42568 KB Output is correct
6 Correct 2392 ms 125928 KB Output is correct
7 Correct 618 ms 40196 KB Output is correct
8 Correct 1061 ms 62648 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1739 ms 97076 KB Output is correct
3 Execution timed out 3072 ms 333988 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2945 ms 456736 KB Output is correct
2 Correct 1450 ms 245164 KB Output is correct
3 Correct 1489 ms 68716 KB Output is correct
4 Correct 2926 ms 456740 KB Output is correct
5 Correct 2924 ms 464436 KB Output is correct
6 Correct 569 ms 62368 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 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 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 476 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 4 ms 844 KB Output is correct
20 Correct 4 ms 844 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 36 ms 5980 KB Output is correct
23 Correct 39 ms 5728 KB Output is correct
24 Correct 41 ms 5596 KB Output is correct
25 Correct 33 ms 5852 KB Output is correct
26 Correct 38 ms 5524 KB Output is correct
27 Correct 8 ms 1356 KB Output is correct
28 Correct 8 ms 1368 KB Output is correct
29 Correct 7 ms 1224 KB Output is correct
30 Correct 82 ms 11960 KB Output is correct
31 Correct 95 ms 11664 KB Output is correct
32 Correct 85 ms 11072 KB Output is correct
33 Correct 77 ms 8044 KB Output is correct
34 Correct 77 ms 9280 KB Output is correct
35 Correct 82 ms 9384 KB Output is correct
36 Correct 1833 ms 103912 KB Output is correct
37 Correct 1734 ms 101512 KB Output is correct
38 Correct 1778 ms 105384 KB Output is correct
39 Correct 798 ms 30916 KB Output is correct
40 Correct 784 ms 31156 KB Output is correct
41 Correct 791 ms 30976 KB Output is correct
42 Correct 508 ms 35488 KB Output is correct
43 Correct 965 ms 155324 KB Output is correct
44 Correct 1016 ms 155292 KB Output is correct
45 Correct 986 ms 155040 KB Output is correct
46 Correct 1022 ms 155168 KB Output is correct
47 Correct 952 ms 155556 KB Output is correct
48 Correct 968 ms 155316 KB Output is correct
49 Correct 949 ms 155352 KB Output is correct
50 Correct 961 ms 155232 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 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 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 476 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 4 ms 844 KB Output is correct
20 Correct 4 ms 844 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 36 ms 5980 KB Output is correct
23 Correct 39 ms 5728 KB Output is correct
24 Correct 41 ms 5596 KB Output is correct
25 Correct 33 ms 5852 KB Output is correct
26 Correct 38 ms 5524 KB Output is correct
27 Correct 228 ms 28984 KB Output is correct
28 Correct 265 ms 29952 KB Output is correct
29 Correct 216 ms 27124 KB Output is correct
30 Correct 228 ms 27272 KB Output is correct
31 Correct 493 ms 42568 KB Output is correct
32 Correct 2392 ms 125928 KB Output is correct
33 Correct 618 ms 40196 KB Output is correct
34 Correct 1061 ms 62648 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 1739 ms 97076 KB Output is correct
37 Execution timed out 3072 ms 333988 KB Time limit exceeded
38 Halted 0 ms 0 KB -