oj.uz

답안 #252849

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252849 2020-07-26T10:51:52 Z user202729 원 고르기 (APIO18_circle_selection) C++17
49 / 100
 3000 ms 43348 KB 
#ifndef LOCAL
#define NDEBUG 1
#endif
#include<bits/stdc++.h>

int main(){
	std::ios::sync_with_stdio(0);std::cin.tie(0);

	using Index=int; // for circles
	struct Circle{
		int x, y, r;
		bool intersect(Circle other) const{
			assert(r>0); assert(other.r>0);
			return int64_t(x-other.x)*(x-other.x)+int64_t(y-other.y)*(y-other.y)<=
				int64_t(r+other.r)*(r+other.r);
		}
	};
	int number; std::cin>>number;
	std::vector<Circle> circles(number);
	for(auto& [x, y, r]: circles)
		std::cin>>x>>y>>r; // r==0: deleted

	struct A{
		Index index; int r;
		bool operator<(A other) const{
			return r!=other.r ? r<other.r: index>other.index;
		}
	};
	std::priority_queue<A> q;
	for(Index index=0; index<number; ++index)
		q.push({index, circles[index].r});

	auto const callRange=[&](auto& object, int first, int last, auto function){
		auto iterator=object.lower_bound(first);
		while(iterator!=object.end() and iterator->first<last){
			function(iterator->second);
			++iterator;
		}
	};

	std::vector<int> result(number);
	assert((result.assign(number, -1), true));

	std::map<int, std::map<int, std::vector<Index>>> grid;
	for(int step=30; step;--step){
		grid.clear();
		for(Index index=0; index<number; ++index){
			auto const [x, y, r]=circles[index];
			if(r==0) continue;
			assert(r<(1<<step));
		
			grid[x>>step][y>>step].push_back(index);
		}

		while(true){
			if(q.empty())
				goto break_outer;

			auto [index, r_]=q.top();
			auto const cur=circles[index]; auto const [x, y, r]=cur;
			if(r==0) {
				q.pop();
				continue;
			}
			assert(r==r_);
			if(r<((1<<step)>>1))
				break; // goto next step -- without popping from q

			q.pop();
			circles[index].r=0;

			assert(result[index]==-1); result[index]=index;
			callRange(grid, (x>>step)-2, (x>>step)+3, [&](auto& it){
				callRange(it, (y>>step)-2, (y>>step)+3, [&](auto& it){
					it.erase(std::remove_if(begin(it), end(it), [&](Index index1){
						if(index1==index){
							return true;
						}

						auto& cur1=circles[index1];
						assert(cur1.r>0);
						if(cur1.intersect(cur)){
							assert(result[index1]==-1);
							result[index1]=index;
							cur1.r=0;
							return true;
						} else return false;
					}),it.end());
				});
			});
		}
	}
break_outer:

	for(Index index=0; index<number; ++index){
		auto const [x, y, r]=circles[index];
		assert(result[index]!=-1);
		assert(r==0);
	}

	for(auto it: result) std::cout<<it+1<<' ';
	std::cout<<'\n';
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:59:19: warning: unused variable 'r_' [-Wunused-variable]
    auto [index, r_]=q.top();
                   ^
circle_selection.cpp:96:22: warning: unused variable 'x' [-Wunused-variable]
   auto const [x, y, r]=circles[index];
                      ^
circle_selection.cpp:96:22: warning: unused variable 'y' [-Wunused-variable]
circle_selection.cpp:96:22: warning: unused variable 'r' [-Wunused-variable]

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 396 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 4 ms 640 KB Output is correct
20 Correct 4 ms 768 KB Output is correct
21 Correct 4 ms 640 KB Output is correct
22 Correct 20 ms 1408 KB Output is correct
23 Correct 20 ms 1152 KB Output is correct
24 Correct 20 ms 1536 KB Output is correct
25 Correct 25 ms 1664 KB Output is correct
26 Correct 21 ms 1536 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 203 ms 12260 KB Output is correct
2 Correct 208 ms 13028 KB Output is correct
3 Correct 209 ms 12256 KB Output is correct
4 Correct 196 ms 12388 KB Output is correct
5 Correct 512 ms 13668 KB Output is correct
6 Correct 1576 ms 33964 KB Output is correct
7 Correct 583 ms 14600 KB Output is correct
8 Correct 880 ms 19204 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 663 ms 15280 KB Output is correct
3 Execution timed out 3069 ms 42772 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 396 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 4 ms 640 KB Output is correct
20 Correct 4 ms 768 KB Output is correct
21 Correct 4 ms 640 KB Output is correct
22 Correct 20 ms 1408 KB Output is correct
23 Correct 20 ms 1152 KB Output is correct
24 Correct 20 ms 1536 KB Output is correct
25 Correct 25 ms 1664 KB Output is correct
26 Correct 21 ms 1536 KB Output is correct
27 Correct 7 ms 1024 KB Output is correct
28 Correct 7 ms 1024 KB Output is correct
29 Correct 7 ms 1024 KB Output is correct
30 Correct 42 ms 2168 KB Output is correct
31 Correct 43 ms 2492 KB Output is correct
32 Correct 46 ms 2556 KB Output is correct
33 Correct 76 ms 5232 KB Output is correct
34 Correct 71 ms 5232 KB Output is correct
35 Correct 76 ms 4944 KB Output is correct
36 Correct 1008 ms 18372 KB Output is correct
37 Correct 938 ms 17768 KB Output is correct
38 Correct 834 ms 16740 KB Output is correct
39 Correct 316 ms 10480 KB Output is correct
40 Correct 317 ms 10480 KB Output is correct
41 Correct 314 ms 10480 KB Output is correct
42 Correct 249 ms 11000 KB Output is correct
43 Correct 1010 ms 24160 KB Output is correct
44 Correct 994 ms 24140 KB Output is correct
45 Correct 1163 ms 24244 KB Output is correct
46 Correct 1046 ms 24200 KB Output is correct
47 Correct 952 ms 24376 KB Output is correct
48 Correct 1006 ms 24384 KB Output is correct
49 Correct 977 ms 24212 KB Output is correct
50 Correct 1106 ms 24416 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 396 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 4 ms 640 KB Output is correct
20 Correct 4 ms 768 KB Output is correct
21 Correct 4 ms 640 KB Output is correct
22 Correct 20 ms 1408 KB Output is correct
23 Correct 20 ms 1152 KB Output is correct
24 Correct 20 ms 1536 KB Output is correct
25 Correct 25 ms 1664 KB Output is correct
26 Correct 21 ms 1536 KB Output is correct
27 Correct 203 ms 12260 KB Output is correct
28 Correct 208 ms 13028 KB Output is correct
29 Correct 209 ms 12256 KB Output is correct
30 Correct 196 ms 12388 KB Output is correct
31 Correct 512 ms 13668 KB Output is correct
32 Correct 1576 ms 33964 KB Output is correct
33 Correct 583 ms 14600 KB Output is correct
34 Correct 880 ms 19204 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 663 ms 15280 KB Output is correct
37 Execution timed out 3069 ms 42772 KB Time limit exceeded
38 Halted 0 ms 0 KB -