# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402192 | A_D | Circle selection (APIO18_circle_selection) | C++14 | 124 ms | 1100 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>
#define int long long
#define ii pair<int,int>
#define F first
#define S second
#define du long double
using namespace std;
const int N=5010;
pair<ii,ii> a[N];
int vis[N];
void solve()
{
int n;
cin>>n;
for(int i=1;i<=n;i++){
scanf("%lld",&a[i].S.F);
scanf("%lld",&a[i].S.S);
scanf("%lld",&a[i].F.F);
a[i].F.F*=-1;
a[i].F.S=i;
}
sort(a+1,a+n+1);
for(int i=1;i<=n;i++){
a[i].F.F*=-1;
}
int ans=0,t=n;
while(t){
ans++;
int u=0;
for(int i=1;i<=n;i++){
if(vis[a[i].F.S]==0){
vis[a[i].F.S]=a[i].F.S;
t--;
u=i;
break;
}
}
for(int i=1;i<=n;i++){
if(vis[a[i].F.S]==0){
du x=a[i].S.F-a[u].S.F;
du y=a[i].S.S-a[u].S.S;
du dis=sqrt(x*x+y*y);
du re=a[i].F.F+a[u].F.F;
if(re>=dis){
vis[a[i].F.S]=vis[a[u].F.S];
t--;
}
}
}
}
for(int i=1;i<=n;i++){
cout<<vis[i]<<" ";
}
}
main()
{
int t=1;
// cin>>t;
while(t--)solve();
}
/*
11
9 9 2
13 2 1
11 8 2
3 3 2
3 12 1
12 14 1
9 8 5
2 8 2
5 2 1
14 4 2
14 14 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... |