oj.uz

답안 #533437

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533437 2022-03-06T04:16:10 Z flappybird 원 고르기 (APIO18_circle_selection) C++17
49 / 100
 3000 ms 693064 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 / 2) 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 / 2 && !e) e = i - 1;
			int xx, yy;
			for (xx = x - 2; xx <= x + 2; xx++) for (yy = y - 2; yy <= y + 2; yy++) 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;
			for (xx = x - 2; xx <= x + 2; xx++) for (yy = y - 2; yy <= y + 2; yy++) {
				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

# 결과 실행 시간 메모리 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 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 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 588 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 1228 KB Output is correct
20 Correct 5 ms 1228 KB Output is correct
21 Correct 6 ms 1300 KB Output is correct
22 Correct 52 ms 11660 KB Output is correct
23 Correct 77 ms 11612 KB Output is correct
24 Correct 53 ms 11660 KB Output is correct
25 Correct 49 ms 11664 KB Output is correct
26 Correct 63 ms 11656 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 301 ms 41708 KB Output is correct
2 Correct 329 ms 43396 KB Output is correct
3 Correct 316 ms 41744 KB Output is correct
4 Correct 312 ms 41720 KB Output is correct
5 Correct 523 ms 69276 KB Output is correct
6 Correct 2669 ms 124756 KB Output is correct
7 Correct 876 ms 68896 KB Output is correct
8 Correct 1291 ms 74088 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3082 ms 693064 KB Time limit exceeded
2 Halted 0 ms 0 KB -

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 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 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 588 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 1228 KB Output is correct
20 Correct 5 ms 1228 KB Output is correct
21 Correct 6 ms 1300 KB Output is correct
22 Correct 52 ms 11660 KB Output is correct
23 Correct 77 ms 11612 KB Output is correct
24 Correct 53 ms 11660 KB Output is correct
25 Correct 49 ms 11664 KB Output is correct
26 Correct 63 ms 11656 KB Output is correct
27 Correct 11 ms 2380 KB Output is correct
28 Correct 11 ms 2380 KB Output is correct
29 Correct 10 ms 2380 KB Output is correct
30 Correct 123 ms 23268 KB Output is correct
31 Correct 180 ms 23212 KB Output is correct
32 Correct 136 ms 23300 KB Output is correct
33 Correct 109 ms 14808 KB Output is correct
34 Correct 110 ms 14780 KB Output is correct
35 Correct 116 ms 15480 KB Output is correct
36 Correct 2331 ms 223596 KB Output is correct
37 Correct 2206 ms 224024 KB Output is correct
38 Correct 2371 ms 222316 KB Output is correct
39 Correct 1824 ms 29128 KB Output is correct
40 Correct 1896 ms 29876 KB Output is correct
41 Correct 2004 ms 29076 KB Output is correct
42 Correct 420 ms 27872 KB Output is correct
43 Correct 949 ms 202656 KB Output is correct
44 Correct 1117 ms 202760 KB Output is correct
45 Correct 925 ms 202496 KB Output is correct
46 Correct 1078 ms 202892 KB Output is correct
47 Correct 937 ms 202784 KB Output is correct
48 Correct 960 ms 202804 KB Output is correct
49 Correct 915 ms 202908 KB Output is correct
50 Correct 944 ms 202636 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 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 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 588 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 1228 KB Output is correct
20 Correct 5 ms 1228 KB Output is correct
21 Correct 6 ms 1300 KB Output is correct
22 Correct 52 ms 11660 KB Output is correct
23 Correct 77 ms 11612 KB Output is correct
24 Correct 53 ms 11660 KB Output is correct
25 Correct 49 ms 11664 KB Output is correct
26 Correct 63 ms 11656 KB Output is correct
27 Correct 301 ms 41708 KB Output is correct
28 Correct 329 ms 43396 KB Output is correct
29 Correct 316 ms 41744 KB Output is correct
30 Correct 312 ms 41720 KB Output is correct
31 Correct 523 ms 69276 KB Output is correct
32 Correct 2669 ms 124756 KB Output is correct
33 Correct 876 ms 68896 KB Output is correct
34 Correct 1291 ms 74088 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 2190 ms 207988 KB Output is correct
37 Execution timed out 3113 ms 683116 KB Time limit exceeded
38 Halted 0 ms 0 KB -