# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
710028 | vjudge1 | Circle selection (APIO18_circle_selection) | C++17 | 3066 ms | 14348 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
using namespace std;
const int maxn = 3e5 + 10;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
#define ff first
#define ss second
int calc(ii x, ii y)
{
return (x.ff-y.ff)*(x.ff-y.ff) + (x.ss-y.ss)*(x.ss-y.ss);
}
bool dau[maxn];
int res[maxn];
int n;
iii a[maxn];
int id[maxn];
bool cmp(int x, int y)
{
if (a[x].ss!=a[y].ss) return a[x].ss>a[y].ss;
return x<y;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
cin>>n;
for (int i=1; i<=n; i++)
{
cin>>a[i].ff.ff>>a[i].ff.ss>>a[i].ss;
dau[i]=0;
id[i]=i;
}
sort(id+1,id+n+1,cmp);
for (int i=1; i<=n; i++)
{
int j = id[i];
if (dau[j]) continue;
dau[j] = 1;
res[j] = j;
for (int z=1; z<=n; z++)
{
if (dau[z]) continue;
int temp = calc(a[z].ff,a[j].ff);
int val = (a[j].ss + a[z].ss) * (a[j].ss + a[z].ss);
if (temp<=val)
{
dau[z] = 1;
res[z] = j;
}
}
}
for (int i=1; i<=n; i++) cout<<res[i]<<' '; cout<<'\n';
}
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... |