# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
252911 | user202729 | Circle selection (APIO18_circle_selection) | C++17 | 2366 ms | 111768 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// scanf/printf.
#ifndef LOCAL
#define NDEBUG 1
#endif
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
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;
}
};
int main(){
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::scanf("%d",&number);
std::vector<Circle> circles(number);
for(auto& [x, y, r]: circles){
std::scanf("%d%d%d",&x,&y,&r);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |