| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 96546 | janlivens | Towns (IOI15_towns) | C++14 | 0 ms | 0 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.
// This Program is made by Jan(Codezebra)
#include<bits/stdc++.h>
#include "grader.h"
#define int long long
#define INF 0x3f3f3f3f
using namespace std;
int hubDistance(int n,int sub){
int dist[n][n];
int mx=0,my=0,ma=0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
dist[i][j]=getdistance(i,j);
dist[j][i]=dist[i][j];
if(dist[i][j]>ma){
mx=i;
my=j;
ma=dist[i][j];
}
}
}
int ans=INF
int(int i=0;i<n;i++){
int a=dist[mx][my],b=dist[mx][i],c=dist[my][i];
ans=min(ans,max(a+b-c,max(a-b+c,-a+b+c)));
}
return ans;
}