# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1216628 | JooDdae | Towns (IOI15_towns) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
int hubDistance(int N, int sub) {
vector<vector<int>> D(N, vector<int>(N, 0));
for(int i=1;i<N;i++) D[0][i] = D[0][i] = getDistance(0, i);
int E = max_element(D[0].begin(), D[0].end()) - D[0].begin();
for(int i=0;i<N;i++) if(i != E) D[E][i] = D[i][E] = getDistance(E, i);
int X = max_element(D[E].begin(), D[E].end()) - D[E].begin();
vector<int> C(N, 0);
for(int i=1;i<N;i++) if(i != E) C[i] = (D[E][i]+D[0][E] - D[0][i])/2;
int R = 0;
for(int i=1;i<N;i++) if(i != E) R = max(R, max(C[i], D[E][X]-C[i]));
return R;
}