# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113283 | TadijaSebez | Towns (IOI15_towns) | C++11 | 18 ms | 1208 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 "towns.h"
#include <bits/stdc++.h>
using namespace std;
const int N=120;
int n,cen,den;
int a[N],b[N],c[N];
int hubDistance(int _N, int sub)
{
n=_N;cen=den=0;
for(int i=0;i<n;i++) a[i]=b[i]=c[i]=0;
for(int i=1;i<n;i++)
{
a[i]=getDistance(0,i);
if(a[i]>a[cen]) cen=i;
}
for(int i=0;i<n;i++) if(i!=cen)
{
b[i]=getDistance(cen,i);
if(b[i]>b[den]) den=i;
}
int diam=b[den],ans=diam;
for(int i=0;i<n;i++) if(i!=cen && i!=den)
{
c[i]=getDistance(den,i);
int tmp=(c[i]+diam-b[i])/2;
tmp=max(tmp,diam-tmp);
ans=min(ans,tmp);
}
return ans;
}
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... |