# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96570 | rubenvd | Towns (IOI15_towns) | C++14 | 18 ms | 632 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"
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 )
for( int j = 0; j < n; ++j )
m[i][j] = -1;
int maxi = -1;
for( int i = 0; i < n; ++i ){
int disI = getDistance(i, 0);
m[0][i] = m[i][0] = disI;
if( disI > maxi ){
maxi = disI;
s = i;
}
}
for( int i = 1; i < n; ++i ){
int disT = getDistance(s, i);
m[s][i] = m[i][s] = disT;
if( disT > maxd ){
maxd = disT;
t = i;
}
}
int mini = 1e7+5;
for( int i = 0; i < n; ++i ){
if( i != s && i != t ){
int z = (getDistance(i, t) - m[i][s] - maxd)/-2;
int x = maxd - z, y = m[i][s] - z;
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;
}*/
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... |