# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1072403 | Zicrus | Towns (IOI15_towns) | C++17 | 11 ms | 868 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;
typedef long long ll;
unordered_map<ll, int> cache;
int getDist(int a, int b) {
if (a == b) return 0;
if (a < b) swap(a, b);
ll hash = ((ll)a << 31) | b;
if (cache.count(hash)) return cache[hash];
return cache[hash] = getDistance(a, b);
}
int hubDistance(int n, int sub) {
cache.clear();
ll a = 0, b = 0;
ll mxDist = 0;
for (int i = 1; i < n; i++) {
ll val = getDist(0, i);
if (val > mxDist) {
mxDist = val;
a = i;
}
}
mxDist = 0;
for (int i = 1; i < n; i++) {
ll val = getDist(a, i);
if (val > mxDist) {
mxDist = val;
b = i;
}
}
ll res = 1ll << 62ll;
for (int i = 0; i < n; i++) {
if (i == a || i == b) continue;
ll distA = getDist(i, a);
ll distB = getDist(i, b);
ll nw = (distA + distB - mxDist) / 2;
distA -= nw;
distB -= nw;
ll val = max(distA, distB);
res = min(res, val);
}
return res;
}
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... |