# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167686 | tinjyu | Circle selection (APIO18_circle_selection) | C++14 | 3051 ms | 32852 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 <iostream>
#include <cmath>
using namespace std;
long long int k[300005],n,x[500005],y[500005],ri[500005],id[500005],tmp[500005][4],tag[500005],ans[500005];
int qs(int s,int e)
{
int l=s,mid=(s+e)/2,r=mid+1,p=l;
if(mid>s)qs(s,mid);
if(e>mid+1)qs(mid+1,e);
while(l<=mid && r<=e)
{
if(ri[l]>ri[r] || (ri[l]==ri[r] && id[l]<id[r]))
{
tmp[p][0]=x[l];
tmp[p][1]=y[l];
tmp[p][2]=ri[l];
tmp[p][3]=id[l];
l++;
p++;
}
else
{
tmp[p][0]=x[r];
tmp[p][1]=y[r];
tmp[p][2]=ri[r];
tmp[p][3]=id[r];
r++;
p++;
}
}
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... |