# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
552732 | iancu | 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 "towns.h"
#include <vector>
using namespace std;
int hubDistance(int N, int sub) {
vector<vector<int>> dist(N, vector<int>(N, -1));
int getDist = [&dist](int a, int b) {
if (dist[a][b] == -1)
dist[a][b] = dist[b][a] = getDistance(a, b);
return dist[a][b];
};
int D1, D2, dist_max = 0;
for (int i = 1; i < N; ++i)
if (getDist(0, i) > dist_max) {
dist_max = getDist(0, i);
D1 = i;
}
dist_max = 0;
for (int i = 0; i < N; ++i)
if (i != D1 && getDist(D1, i) > dist_max) {
dist_max = getDist(D1, i);
D2 = i;
}
int R = getDist(D1, D2);
for (int i = 0; i < N; ++i)
if (i != D1 && i != D2) {
int dist_i = (getDist(D1, i) - getDist(D2, i) + getDist(D1, D2)) / 2;
R = min(R, max(dist_i, getDist(D1, D2) - dist_i));
}
return R;
}