#include "towns.h"
#include <bits/stdc++.h>
#define ll long long
#define SZ(x) ((int)(x).size())
using namespace std;
int hubDistance(int N, int sub) {
int farthest = 1, maxDist = 0;
for (int i = 2; i <= N; i++) {
int d = getDistance(1, i);
if (d > maxDist) {
maxDist = d;
farthest = i;
}
}
int diamStart = farthest;
maxDist = 0;
for (int i = 1; i <= N; i++) {
if (i == diamStart) continue;
int d = getDistance(diamStart, i);
if (d > maxDist) {
maxDist = d;
farthest = i;
}
}
return maxDist;
}
# | 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... |