# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1098320 | alexander707070 | Towns (IOI15_towns) | C++14 | 9 ms | 1112 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>
#include "towns.h"
#define MAXN 200
using namespace std;
int n,r;
int dist[MAXN],s,t,diameter,dist2[MAXN];
int hubDistance(int N, int sub) {
int n=N;
s=0;
for(int i=1;i<n;i++){
dist[i]=getDistance(0,i);
if(dist[i]>dist[s])s=i;
}
dist[s]=0; t=s;
for(int i=0;i<n;i++){
if(i==s)continue;
dist[i]=getDistance(s,i);
if(dist[i]>dist[t])t=i;
}
diameter=dist[t]; r=1000000;
for(int i=0;i<n;i++){
if(i==s or i==t)continue;
dist2[i]=getDistance(t,i);
int sum=(diameter+dist[i]+dist2[i])/2;
r=min(r,max(sum-dist[i],sum-dist2[i]));
}
return r;
}
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... |