// not sure what's the bottleneck
#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;
int step=30;
for(Index index=0; index<number; ++index){
auto const [x, y, r]=circles[index];
assert(r>0); assert(r<(1<<step));
grid[x>>step][y>>step].push_back(index);
}
for(; step;--step){
auto oldGrid=std::move(grid);
grid.clear();
for(auto const& [a, it]: oldGrid)
for(auto const& [b, indices]: it){
std::array<std::array<std::vector<Index>, 2>, 2> parts;
for(auto const index: indices){
auto [x, y, r]=circles[index];
assert(r>0);
assert((x>>(step+1))==a);
assert((y>>(step+1))==b);
parts[x>>step&1][y>>step&1].push_back(index);
}
for(int x=0; x<2; ++x){
auto& tmp=grid[a<<1|x];
for(int y=0; y<2; ++y) if(not parts[x][y].empty())
tmp[b<<1|y]=std::move(parts[x][y]);
}
}
/*
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:49:22: warning: unused variable 'r' [-Wunused-variable]
auto const [x, y, r]=circles[index];
^
circle_selection.cpp:63:19: warning: unused variable 'r' [-Wunused-variable]
auto [x, y, r]=circles[index];
^
circle_selection.cpp:91:19: warning: unused variable 'r_' [-Wunused-variable]
auto [index, r_]=q.top();
^
circle_selection.cpp:128:22: warning: unused variable 'x' [-Wunused-variable]
auto const [x, y, r]=circles[index];
^
circle_selection.cpp:128:22: warning: unused variable 'y' [-Wunused-variable]
circle_selection.cpp:128:22: warning: unused variable 'r' [-Wunused-variable]
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
288 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
1 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 |
384 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 |
2 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 |
2 ms |
384 KB |
Output is correct |
19 |
Correct |
3 ms |
640 KB |
Output is correct |
20 |
Correct |
4 ms |
768 KB |
Output is correct |
21 |
Correct |
6 ms |
640 KB |
Output is correct |
22 |
Correct |
20 ms |
2304 KB |
Output is correct |
23 |
Correct |
26 ms |
1792 KB |
Output is correct |
24 |
Correct |
21 ms |
2560 KB |
Output is correct |
25 |
Correct |
36 ms |
3576 KB |
Output is correct |
26 |
Correct |
34 ms |
2808 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
266 ms |
13328 KB |
Output is correct |
2 |
Correct |
224 ms |
14792 KB |
Output is correct |
3 |
Correct |
223 ms |
13624 KB |
Output is correct |
4 |
Correct |
218 ms |
13744 KB |
Output is correct |
5 |
Correct |
345 ms |
14932 KB |
Output is correct |
6 |
Correct |
928 ms |
63008 KB |
Output is correct |
7 |
Correct |
484 ms |
16120 KB |
Output is correct |
8 |
Correct |
483 ms |
25588 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
475 ms |
26188 KB |
Output is correct |
3 |
Correct |
2071 ms |
77800 KB |
Output is correct |
4 |
Correct |
2103 ms |
85488 KB |
Output is correct |
5 |
Correct |
1482 ms |
69348 KB |
Output is correct |
6 |
Correct |
577 ms |
34284 KB |
Output is correct |
7 |
Correct |
344 ms |
19568 KB |
Output is correct |
8 |
Correct |
61 ms |
6008 KB |
Output is correct |
9 |
Correct |
1821 ms |
81636 KB |
Output is correct |
10 |
Correct |
1174 ms |
62380 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2025 ms |
82872 KB |
Output is correct |
2 |
Execution timed out |
3106 ms |
185188 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
288 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
1 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 |
384 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 |
2 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 |
2 ms |
384 KB |
Output is correct |
19 |
Correct |
3 ms |
640 KB |
Output is correct |
20 |
Correct |
4 ms |
768 KB |
Output is correct |
21 |
Correct |
6 ms |
640 KB |
Output is correct |
22 |
Correct |
20 ms |
2304 KB |
Output is correct |
23 |
Correct |
26 ms |
1792 KB |
Output is correct |
24 |
Correct |
21 ms |
2560 KB |
Output is correct |
25 |
Correct |
36 ms |
3576 KB |
Output is correct |
26 |
Correct |
34 ms |
2808 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 |
35 ms |
3320 KB |
Output is correct |
31 |
Correct |
39 ms |
4324 KB |
Output is correct |
32 |
Correct |
43 ms |
4344 KB |
Output is correct |
33 |
Correct |
66 ms |
4976 KB |
Output is correct |
34 |
Correct |
70 ms |
4976 KB |
Output is correct |
35 |
Correct |
70 ms |
4592 KB |
Output is correct |
36 |
Correct |
621 ms |
31276 KB |
Output is correct |
37 |
Correct |
696 ms |
30156 KB |
Output is correct |
38 |
Correct |
613 ms |
28044 KB |
Output is correct |
39 |
Correct |
207 ms |
12144 KB |
Output is correct |
40 |
Correct |
198 ms |
12272 KB |
Output is correct |
41 |
Correct |
199 ms |
12312 KB |
Output is correct |
42 |
Correct |
171 ms |
12460 KB |
Output is correct |
43 |
Correct |
614 ms |
59212 KB |
Output is correct |
44 |
Correct |
687 ms |
59248 KB |
Output is correct |
45 |
Correct |
573 ms |
59120 KB |
Output is correct |
46 |
Correct |
693 ms |
59280 KB |
Output is correct |
47 |
Correct |
575 ms |
59248 KB |
Output is correct |
48 |
Correct |
575 ms |
59248 KB |
Output is correct |
49 |
Correct |
572 ms |
59248 KB |
Output is correct |
50 |
Correct |
585 ms |
59248 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
288 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
1 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 |
384 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 |
2 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 |
2 ms |
384 KB |
Output is correct |
19 |
Correct |
3 ms |
640 KB |
Output is correct |
20 |
Correct |
4 ms |
768 KB |
Output is correct |
21 |
Correct |
6 ms |
640 KB |
Output is correct |
22 |
Correct |
20 ms |
2304 KB |
Output is correct |
23 |
Correct |
26 ms |
1792 KB |
Output is correct |
24 |
Correct |
21 ms |
2560 KB |
Output is correct |
25 |
Correct |
36 ms |
3576 KB |
Output is correct |
26 |
Correct |
34 ms |
2808 KB |
Output is correct |
27 |
Correct |
266 ms |
13328 KB |
Output is correct |
28 |
Correct |
224 ms |
14792 KB |
Output is correct |
29 |
Correct |
223 ms |
13624 KB |
Output is correct |
30 |
Correct |
218 ms |
13744 KB |
Output is correct |
31 |
Correct |
345 ms |
14932 KB |
Output is correct |
32 |
Correct |
928 ms |
63008 KB |
Output is correct |
33 |
Correct |
484 ms |
16120 KB |
Output is correct |
34 |
Correct |
483 ms |
25588 KB |
Output is correct |
35 |
Correct |
0 ms |
384 KB |
Output is correct |
36 |
Correct |
475 ms |
26188 KB |
Output is correct |
37 |
Correct |
2071 ms |
77800 KB |
Output is correct |
38 |
Correct |
2103 ms |
85488 KB |
Output is correct |
39 |
Correct |
1482 ms |
69348 KB |
Output is correct |
40 |
Correct |
577 ms |
34284 KB |
Output is correct |
41 |
Correct |
344 ms |
19568 KB |
Output is correct |
42 |
Correct |
61 ms |
6008 KB |
Output is correct |
43 |
Correct |
1821 ms |
81636 KB |
Output is correct |
44 |
Correct |
1174 ms |
62380 KB |
Output is correct |
45 |
Correct |
2025 ms |
82872 KB |
Output is correct |
46 |
Execution timed out |
3106 ms |
185188 KB |
Time limit exceeded |
47 |
Halted |
0 ms |
0 KB |
- |