| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1325294 | altern23 | Towns (IOI15_towns) | C++20 | 15 ms | 444 KiB |
#include "towns.h"
#include <bits/stdc++.h>
using namespace std;
int hubDistance(int N, int sub) {
pair<int, int> MX = {0, 0};
for (int i = 1; i < N; i++) {
MX = max(MX, {getDistance(0, i), i});
}
int root = MX.second, diam = 0;
vector <int> dist(N);
int j = root;
for (int i = 0; i < N; i++) {
if (i == root) continue;
dist[i] = getDistance(root, i);
if (diam < dist[i]) {
diam = dist[i];
j = i;
}
}
int ans = diam;
for (int i = 0; i < N; i++) {
int cur = (dist[i] + dist[j] - getDistance(i, j)) / 2;
ans = min(ans, max(cur, diam - cur));
}
return ans;
}
| # | 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... | ||||
