oj.uz

답안 #533455

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533455 2022-03-06T05:19:02 Z jjang36524 원 고르기 (APIO18_circle_selection) C++14
64 / 100
 3000 ms 480424 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<pll, pll> in[MAX];
ll X[MAX];
ll Y[MAX];
ll R[MAX];
ll 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<pll, pll>& p1, pair<pll, pll>& 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;
			mp[((ll)x << 31LL) + y].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;
				
				if (abs(x - xx) + abs(y - yy) <= 1) {
                  vector<int> v;
					for (auto c : mp[t]) {
						if (!ans[c] && chk(c, i)) ans[c] = i;
						if (!ans[c]) v.push_back(c);
					}
					mp[t] = v;
				}
				else {
					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;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:64:8: warning: unused variable 'xx' [-Wunused-variable]
   64 |    int xx, yy;
      |        ^~
circle_selection.cpp:64:12: warning: unused variable 'yy' [-Wunused-variable]
   64 |    int xx, yy;
      |            ^~

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 316 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 316 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 312 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 456 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 3 ms 844 KB Output is correct
20 Correct 3 ms 844 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 17 ms 4188 KB Output is correct
23 Correct 19 ms 4316 KB Output is correct
24 Correct 17 ms 3880 KB Output is correct
25 Correct 19 ms 4128 KB Output is correct
26 Correct 25 ms 4268 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 158 ms 25332 KB Output is correct
2 Correct 157 ms 24724 KB Output is correct
3 Correct 166 ms 24836 KB Output is correct
4 Correct 158 ms 24596 KB Output is correct
5 Correct 171 ms 27504 KB Output is correct
6 Correct 948 ms 62276 KB Output is correct
7 Correct 214 ms 28948 KB Output is correct
8 Correct 327 ms 35860 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 826 ms 71500 KB Output is correct
3 Correct 2669 ms 188248 KB Output is correct
4 Correct 2772 ms 180992 KB Output is correct
5 Correct 2242 ms 153248 KB Output is correct
6 Correct 869 ms 72372 KB Output is correct
7 Correct 399 ms 58644 KB Output is correct
8 Correct 53 ms 9868 KB Output is correct
9 Correct 2766 ms 173300 KB Output is correct
10 Correct 1715 ms 145692 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3008 ms 480424 KB Time limit exceeded
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 316 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 316 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 312 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 456 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 3 ms 844 KB Output is correct
20 Correct 3 ms 844 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 17 ms 4188 KB Output is correct
23 Correct 19 ms 4316 KB Output is correct
24 Correct 17 ms 3880 KB Output is correct
25 Correct 19 ms 4128 KB Output is correct
26 Correct 25 ms 4268 KB Output is correct
27 Correct 5 ms 1144 KB Output is correct
28 Correct 6 ms 1128 KB Output is correct
29 Correct 6 ms 1128 KB Output is correct
30 Correct 43 ms 8612 KB Output is correct
31 Correct 41 ms 8460 KB Output is correct
32 Correct 35 ms 7248 KB Output is correct
33 Correct 57 ms 8044 KB Output is correct
34 Correct 58 ms 8044 KB Output is correct
35 Correct 68 ms 8252 KB Output is correct
36 Correct 819 ms 75848 KB Output is correct
37 Correct 914 ms 68868 KB Output is correct
38 Correct 872 ms 76604 KB Output is correct
39 Correct 241 ms 14292 KB Output is correct
40 Correct 205 ms 14220 KB Output is correct
41 Correct 236 ms 14272 KB Output is correct
42 Correct 94 ms 13508 KB Output is correct
43 Correct 768 ms 135976 KB Output is correct
44 Correct 999 ms 136088 KB Output is correct
45 Correct 771 ms 135972 KB Output is correct
46 Correct 897 ms 136148 KB Output is correct
47 Correct 762 ms 136232 KB Output is correct
48 Correct 778 ms 136228 KB Output is correct
49 Correct 780 ms 136300 KB Output is correct
50 Correct 772 ms 136136 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 316 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 316 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 312 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 456 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 3 ms 844 KB Output is correct
20 Correct 3 ms 844 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 17 ms 4188 KB Output is correct
23 Correct 19 ms 4316 KB Output is correct
24 Correct 17 ms 3880 KB Output is correct
25 Correct 19 ms 4128 KB Output is correct
26 Correct 25 ms 4268 KB Output is correct
27 Correct 158 ms 25332 KB Output is correct
28 Correct 157 ms 24724 KB Output is correct
29 Correct 166 ms 24836 KB Output is correct
30 Correct 158 ms 24596 KB Output is correct
31 Correct 171 ms 27504 KB Output is correct
32 Correct 948 ms 62276 KB Output is correct
33 Correct 214 ms 28948 KB Output is correct
34 Correct 327 ms 35860 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 826 ms 71500 KB Output is correct
37 Correct 2669 ms 188248 KB Output is correct
38 Correct 2772 ms 180992 KB Output is correct
39 Correct 2242 ms 153248 KB Output is correct
40 Correct 869 ms 72372 KB Output is correct
41 Correct 399 ms 58644 KB Output is correct
42 Correct 53 ms 9868 KB Output is correct
43 Correct 2766 ms 173300 KB Output is correct
44 Correct 1715 ms 145692 KB Output is correct
45 Execution timed out 3008 ms 480424 KB Time limit exceeded
46 Halted 0 ms 0 KB -