# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96559 | rubenvd | 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.
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
/*int dis[110][110];
int getDistance( int i, int j ){
return dis[i][j];
}*/
int hubDistance( int n, int sub ){
int m[n][n], s, t, maxd = -1;
for( int i = 0; i < n; ++i ){
m[i][i] = 0;
for( int j = i+1; j < n; ++j ){
m[i][j] = getDistance(i,j);
m[j][i] = m[i][j];
if( m[i][j] > maxd ){
s = i;
t = j;
maxd = m[i][j];
}
}
}
int mini = 1e7+5;
for( int i = 0; i < n; ++i ){
if( i != s && i != t ){
int z = (m[i][t] - m[i][s] - maxd)/-2;
int x = maxd - z, y = m[i][s] - z;
//cout << s << " <-> " << t << " <-> " << i << " " << z << " " << y << " " << x << endl;
mini = min(mini, max(x, z));
}
}
return mini;
}
/*int main(){
int sb, tc, n;
cin >> sb >> tc >> n;
for( int i = 0; i < n; ++i ){
for( int j = 0; j < n; ++j ){
cin >> dis[i][j];
}
}
cout << hubDistance(n, sb) << endl;
return 0;
}*/