oj.uz

답안 #204939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
204939 2020-02-27T13:49:39 Z oolimry 원 고르기 (APIO18_circle_selection) C++14
49 / 100
 3000 ms 444280 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")

using namespace std; 
int n; 
 
struct Circle{
	long long x, y, r, id;
} sorted[300005], arr[300005];;
 
inline bool intersect(Circle a, Circle b){
	return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y) <= (a.r + b.r) * (a.r + b.r);
}
 
inline long long ii(long long a, long long b){
	return a * (1LL << 32LL) + b;
}
long long ans[300005];
 
unordered_map<long long, vector<int>> GRID;
long long gridSize = 1LL << 61LL;
 
void buildGrid(long long newGridSize){
	gridSize = newGridSize;
	GRID.clear();
	
	for(int i = 0;i < n;i++){
		if(ans[i] == -1){
			long long xSquare = arr[i].x / gridSize;
			long long ySquare = arr[i].y / gridSize;
			GRID[ii(xSquare,ySquare)].push_back(i);
		}
	}
}
 
bool comp(Circle a, Circle b){
	if(a.r == b.r) return a.id < b.id;
	else return a.r > b.r;
}
 
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> n;
	fill(ans, ans + n, -1);
	
	for(int i = 0;i < n;i++){
		long long x, y, r; cin >> x >> y >> r;
		x += (1LL << 31LL); y += (1LL << 31LL);
		arr[i] = {x, y, r, i};
		sorted[i] = {x, y, r, i};
	}
	
	sort(sorted,sorted+n,comp);
	
	for(int i = 0;i < n;i++){
		Circle C = sorted[i];
		
		if(ans[C.id] != -1) continue;
		ans[C.id] = C.id;
		
		if(gridSize > 2 * C.r){
			buildGrid(C.r);
		}
		
		long long xSquare = C.x / gridSize;
		long long ySquare = C.y / gridSize;
		
		for(long long x = xSquare - 2;x <= xSquare + 2;x++){
			for(long long y = ySquare - 2;y <= ySquare + 2;y++){
				vector<int> &points = GRID[ii(x,y)];
				
				for(int p = 0;p < (int) points.size();p++){
					if(intersect(arr[points[p]],C)){
						ans[points[p]] = C.id;
												
						points[p] = points.back();
						points.pop_back();
						p--;
					}
				}
			}
		}
	}
	
	for(int i = 0;i < n;i++) cout << ans[i] + 1 << " ";
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 8 ms 760 KB Output is correct
20 Correct 8 ms 760 KB Output is correct
21 Correct 8 ms 760 KB Output is correct
22 Correct 24 ms 4744 KB Output is correct
23 Correct 25 ms 4740 KB Output is correct
24 Correct 25 ms 4872 KB Output is correct
25 Correct 24 ms 4872 KB Output is correct
26 Correct 24 ms 4876 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 220 ms 24148 KB Output is correct
2 Correct 212 ms 23944 KB Output is correct
3 Correct 210 ms 24888 KB Output is correct
4 Correct 222 ms 23884 KB Output is correct
5 Correct 238 ms 27432 KB Output is correct
6 Correct 1183 ms 76880 KB Output is correct
7 Correct 293 ms 30728 KB Output is correct
8 Correct 414 ms 38072 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 1022 ms 85544 KB Output is correct
3 Execution timed out 3097 ms 294204 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 8 ms 760 KB Output is correct
20 Correct 8 ms 760 KB Output is correct
21 Correct 8 ms 760 KB Output is correct
22 Correct 24 ms 4744 KB Output is correct
23 Correct 25 ms 4740 KB Output is correct
24 Correct 25 ms 4872 KB Output is correct
25 Correct 24 ms 4872 KB Output is correct
26 Correct 24 ms 4876 KB Output is correct
27 Correct 12 ms 1144 KB Output is correct
28 Correct 12 ms 1144 KB Output is correct
29 Correct 12 ms 1144 KB Output is correct
30 Correct 61 ms 9272 KB Output is correct
31 Correct 57 ms 9276 KB Output is correct
32 Correct 54 ms 9276 KB Output is correct
33 Correct 82 ms 8564 KB Output is correct
34 Correct 88 ms 8692 KB Output is correct
35 Correct 83 ms 8232 KB Output is correct
36 Correct 1036 ms 86864 KB Output is correct
37 Correct 999 ms 86480 KB Output is correct
38 Correct 1004 ms 86424 KB Output is correct
39 Correct 360 ms 29228 KB Output is correct
40 Correct 351 ms 28908 KB Output is correct
41 Correct 353 ms 28904 KB Output is correct
42 Correct 135 ms 16904 KB Output is correct
43 Correct 1136 ms 142408 KB Output is correct
44 Correct 1329 ms 142584 KB Output is correct
45 Correct 1541 ms 142636 KB Output is correct
46 Correct 1041 ms 142636 KB Output is correct
47 Correct 1038 ms 142664 KB Output is correct
48 Correct 1044 ms 142792 KB Output is correct
49 Correct 1031 ms 142792 KB Output is correct
50 Correct 1034 ms 142664 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 8 ms 760 KB Output is correct
20 Correct 8 ms 760 KB Output is correct
21 Correct 8 ms 760 KB Output is correct
22 Correct 24 ms 4744 KB Output is correct
23 Correct 25 ms 4740 KB Output is correct
24 Correct 25 ms 4872 KB Output is correct
25 Correct 24 ms 4872 KB Output is correct
26 Correct 24 ms 4876 KB Output is correct
27 Correct 220 ms 24148 KB Output is correct
28 Correct 212 ms 23944 KB Output is correct
29 Correct 210 ms 24888 KB Output is correct
30 Correct 222 ms 23884 KB Output is correct
31 Correct 238 ms 27432 KB Output is correct
32 Correct 1183 ms 76880 KB Output is correct
33 Correct 293 ms 30728 KB Output is correct
34 Correct 414 ms 38072 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 1022 ms 85544 KB Output is correct
37 Execution timed out 3097 ms 294204 KB Time limit exceeded
38 Halted 0 ms 0 KB -