oj.uz

Submission #204936

# Submission time Handle Problem Language Result Execution time Memory
204936 2020-02-27T13:43:09 Z oolimry Circle selection (APIO18_circle_selection) C++14
19 / 100
 3000 ms 352360 KB 
#include <bits/stdc++.h>
 
using namespace std;
typedef pair<long long, long long> ii;
 
int n; 
 
struct Circle{
	long long x, y, r, id;
} sorted[300005], arr[300005];;
 
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);
}
 
long long ans[300005];
 
struct pair_hash{
	std::size_t operator () (ii const &pair) const{
		return pair.first ^ pair.second;
	}
};
 
unordered_map<ii, vector<int>, pair_hash> 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 504 KB Output is correct
12 Correct 5 ms 504 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 504 KB Output is correct
16 Correct 5 ms 380 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 380 KB Output is correct
19 Correct 8 ms 760 KB Output is correct
20 Correct 8 ms 760 KB Output is correct
21 Correct 9 ms 760 KB Output is correct
22 Correct 26 ms 5896 KB Output is correct
23 Correct 27 ms 5764 KB Output is correct
24 Correct 27 ms 5768 KB Output is correct
25 Correct 25 ms 5892 KB Output is correct
26 Correct 25 ms 5896 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 226 ms 24356 KB Output is correct
2 Correct 219 ms 23820 KB Output is correct
3 Correct 220 ms 25020 KB Output is correct
4 Correct 214 ms 23744 KB Output is correct
5 Correct 252 ms 27392 KB Output is correct
6 Correct 1076 ms 90732 KB Output is correct
7 Correct 300 ms 32008 KB Output is correct
8 Correct 441 ms 41440 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 Execution timed out 3085 ms 103036 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
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 504 KB Output is correct
12 Correct 5 ms 504 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 504 KB Output is correct
16 Correct 5 ms 380 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 380 KB Output is correct
19 Correct 8 ms 760 KB Output is correct
20 Correct 8 ms 760 KB Output is correct
21 Correct 9 ms 760 KB Output is correct
22 Correct 26 ms 5896 KB Output is correct
23 Correct 27 ms 5764 KB Output is correct
24 Correct 27 ms 5768 KB Output is correct
25 Correct 25 ms 5892 KB Output is correct
26 Correct 25 ms 5896 KB Output is correct
27 Correct 13 ms 1528 KB Output is correct
28 Correct 12 ms 1528 KB Output is correct
29 Correct 13 ms 1400 KB Output is correct
30 Correct 57 ms 11576 KB Output is correct
31 Correct 72 ms 11576 KB Output is correct
32 Correct 61 ms 11576 KB Output is correct
33 Correct 83 ms 9076 KB Output is correct
34 Correct 78 ms 9076 KB Output is correct
35 Correct 84 ms 8740 KB Output is correct
36 Correct 1628 ms 108000 KB Output is correct
37 Correct 1291 ms 107604 KB Output is correct
38 Correct 2325 ms 107328 KB Output is correct
39 Execution timed out 3079 ms 29592 KB Time limit exceeded
40 Halted 0 ms 0 KB -

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 504 KB Output is correct
12 Correct 5 ms 504 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 504 KB Output is correct
16 Correct 5 ms 380 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 380 KB Output is correct
19 Correct 8 ms 760 KB Output is correct
20 Correct 8 ms 760 KB Output is correct
21 Correct 9 ms 760 KB Output is correct
22 Correct 26 ms 5896 KB Output is correct
23 Correct 27 ms 5764 KB Output is correct
24 Correct 27 ms 5768 KB Output is correct
25 Correct 25 ms 5892 KB Output is correct
26 Correct 25 ms 5896 KB Output is correct
27 Correct 226 ms 24356 KB Output is correct
28 Correct 219 ms 23820 KB Output is correct
29 Correct 220 ms 25020 KB Output is correct
30 Correct 214 ms 23744 KB Output is correct
31 Correct 252 ms 27392 KB Output is correct
32 Correct 1076 ms 90732 KB Output is correct
33 Correct 300 ms 32008 KB Output is correct
34 Correct 441 ms 41440 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Execution timed out 3085 ms 103036 KB Time limit exceeded
37 Halted 0 ms 0 KB -