oj.uz

Submission #204938

# Submission time Handle Problem Language Result Execution time Memory
204938 2020-02-27T13:46:34 Z oolimry Circle selection (APIO18_circle_selection) C++14
49 / 100
 3000 ms 444820 KB 
#include <bits/stdc++.h>
 
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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 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 508 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 8 ms 888 KB Output is correct
20 Correct 9 ms 888 KB Output is correct
21 Correct 8 ms 888 KB Output is correct
22 Correct 25 ms 5000 KB Output is correct
23 Correct 26 ms 4868 KB Output is correct
24 Correct 26 ms 4872 KB Output is correct
25 Correct 28 ms 5000 KB Output is correct
26 Correct 25 ms 5000 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 25556 KB Output is correct
2 Correct 229 ms 25224 KB Output is correct
3 Correct 215 ms 26296 KB Output is correct
4 Correct 214 ms 25312 KB Output is correct
5 Correct 242 ms 28712 KB Output is correct
6 Correct 1212 ms 78316 KB Output is correct
7 Correct 299 ms 32008 KB Output is correct
8 Correct 433 ms 39612 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 1016 ms 86840 KB Output is correct
3 Execution timed out 3088 ms 295288 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3118 ms 444820 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 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 508 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 8 ms 888 KB Output is correct
20 Correct 9 ms 888 KB Output is correct
21 Correct 8 ms 888 KB Output is correct
22 Correct 25 ms 5000 KB Output is correct
23 Correct 26 ms 4868 KB Output is correct
24 Correct 26 ms 4872 KB Output is correct
25 Correct 28 ms 5000 KB Output is correct
26 Correct 25 ms 5000 KB Output is correct
27 Correct 13 ms 1144 KB Output is correct
28 Correct 13 ms 1272 KB Output is correct
29 Correct 13 ms 1144 KB Output is correct
30 Correct 62 ms 9272 KB Output is correct
31 Correct 57 ms 9272 KB Output is correct
32 Correct 75 ms 9388 KB Output is correct
33 Correct 83 ms 8564 KB Output is correct
34 Correct 79 ms 8540 KB Output is correct
35 Correct 86 ms 8232 KB Output is correct
36 Correct 1062 ms 86928 KB Output is correct
37 Correct 1036 ms 86608 KB Output is correct
38 Correct 1028 ms 86372 KB Output is correct
39 Correct 385 ms 28996 KB Output is correct
40 Correct 365 ms 28976 KB Output is correct
41 Correct 367 ms 29168 KB Output is correct
42 Correct 145 ms 16904 KB Output is correct
43 Correct 1175 ms 142392 KB Output is correct
44 Correct 1326 ms 142920 KB Output is correct
45 Correct 1529 ms 142664 KB Output is correct
46 Correct 1039 ms 142696 KB Output is correct
47 Correct 1050 ms 142792 KB Output is correct
48 Correct 1036 ms 142792 KB Output is correct
49 Correct 1048 ms 142788 KB Output is correct
50 Correct 1036 ms 142532 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 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 508 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 8 ms 888 KB Output is correct
20 Correct 9 ms 888 KB Output is correct
21 Correct 8 ms 888 KB Output is correct
22 Correct 25 ms 5000 KB Output is correct
23 Correct 26 ms 4868 KB Output is correct
24 Correct 26 ms 4872 KB Output is correct
25 Correct 28 ms 5000 KB Output is correct
26 Correct 25 ms 5000 KB Output is correct
27 Correct 214 ms 25556 KB Output is correct
28 Correct 229 ms 25224 KB Output is correct
29 Correct 215 ms 26296 KB Output is correct
30 Correct 214 ms 25312 KB Output is correct
31 Correct 242 ms 28712 KB Output is correct
32 Correct 1212 ms 78316 KB Output is correct
33 Correct 299 ms 32008 KB Output is correct
34 Correct 433 ms 39612 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 1016 ms 86840 KB Output is correct
37 Execution timed out 3088 ms 295288 KB Time limit exceeded
38 Halted 0 ms 0 KB -