# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
932346 | salmon | Circle selection (APIO18_circle_selection) | C++14 | 44 ms | 1116 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.
#include <bits/stdc++.h>
using namespace std;
long long int x[5100];
long long int y[5100];
long long int r[5100];
vector<pair<long long int,int>> v;
int N;
bool dead[5100];
int killer[5100];
int main(){
scanf(" %d",&N);
for(int i = 0; i < N; i++){
scanf(" %lld",&x[i]);
scanf(" %lld",&y[i]);
scanf(" %lld",&r[i]);
v.push_back(make_pair(r[i],-i));
dead[i] = false;
}
sort(v.begin(),v.end(),greater<pair<long long int,int>>());
for(int i = 0; i < N; i++){
if(dead[-v[i].second]) continue;
int i1 = -v[i].second;
for(int j = 0; j < N; j++){
if(dead[j]) continue;
if( (long long int)(r[j] + r[i1]) * (r[j] + r[i1]) >= (long long int)(x[j] - x[i1]) * (x[j] - x[i1]) + (long long int) (y[j] - y[i1]) * (y[j] - y[i1]) ){
dead[j] = true;
killer[j] = i1;
}
}
}
for(int i = 0 ; i < N; i++){
printf("%d ",killer[i] + 1);
}
}
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... |