oj.uz

답안 #533378

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533378 2022-03-05T19:13:46 Z flappybird 원 고르기 (APIO18_circle_selection) C++17
37 / 100
 1979 ms 211592 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;
			if (R[i] < r) {
				for (xx = x - 1; xx <= x + 1; xx++) for (yy = y - 1; yy <= y + 1; yy++) mp[trans(xx, yy)].push_back(i);
			}
			else {
				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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 320 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 2 ms 448 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 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 504 KB Output is correct
19 Correct 8 ms 1244 KB Output is correct
20 Correct 8 ms 1228 KB Output is correct
21 Correct 9 ms 1100 KB Output is correct
22 Correct 43 ms 7388 KB Output is correct
23 Correct 43 ms 7144 KB Output is correct
24 Correct 42 ms 6868 KB Output is correct
25 Correct 37 ms 7312 KB Output is correct
26 Correct 41 ms 6948 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 52 ms 7660 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1688 ms 123216 KB Output is correct
3 Runtime error 61 ms 7488 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 60 ms 6968 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 320 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 2 ms 448 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 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 504 KB Output is correct
19 Correct 8 ms 1244 KB Output is correct
20 Correct 8 ms 1228 KB Output is correct
21 Correct 9 ms 1100 KB Output is correct
22 Correct 43 ms 7388 KB Output is correct
23 Correct 43 ms 7144 KB Output is correct
24 Correct 42 ms 6868 KB Output is correct
25 Correct 37 ms 7312 KB Output is correct
26 Correct 41 ms 6948 KB Output is correct
27 Correct 17 ms 1520 KB Output is correct
28 Correct 15 ms 1612 KB Output is correct
29 Correct 16 ms 1452 KB Output is correct
30 Correct 101 ms 15060 KB Output is correct
31 Correct 108 ms 14620 KB Output is correct
32 Correct 95 ms 13224 KB Output is correct
33 Correct 151 ms 13008 KB Output is correct
34 Correct 149 ms 10512 KB Output is correct
35 Correct 156 ms 10548 KB Output is correct
36 Correct 1946 ms 151312 KB Output is correct
37 Correct 1638 ms 116612 KB Output is correct
38 Correct 1979 ms 151272 KB Output is correct
39 Correct 1142 ms 46736 KB Output is correct
40 Correct 1118 ms 46740 KB Output is correct
41 Correct 1130 ms 46796 KB Output is correct
42 Correct 547 ms 45332 KB Output is correct
43 Correct 949 ms 211148 KB Output is correct
44 Correct 949 ms 211252 KB Output is correct
45 Correct 940 ms 211072 KB Output is correct
46 Correct 1014 ms 211200 KB Output is correct
47 Correct 947 ms 211356 KB Output is correct
48 Correct 1014 ms 211308 KB Output is correct
49 Correct 1010 ms 211592 KB Output is correct
50 Correct 989 ms 211304 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 320 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 2 ms 448 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 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 504 KB Output is correct
19 Correct 8 ms 1244 KB Output is correct
20 Correct 8 ms 1228 KB Output is correct
21 Correct 9 ms 1100 KB Output is correct
22 Correct 43 ms 7388 KB Output is correct
23 Correct 43 ms 7144 KB Output is correct
24 Correct 42 ms 6868 KB Output is correct
25 Correct 37 ms 7312 KB Output is correct
26 Correct 41 ms 6948 KB Output is correct
27 Runtime error 52 ms 7660 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -