# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
383731 | luciocf | Towns (IOI15_towns) | C++14 | 24 ms | 492 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;
const int maxn = 120;
int n;
int du[maxn];
int hubDistance(int N, int sub)
{
n = N;
int mx = 0, u = 1;
for (int i = 1; i < n; i++)
{
int x = getDistance(0, i);
if (x > mx)
{
mx = x;
u = i;
}
}
int v;
int diam = 0;
for (int i = 0; i < n; i++)
{
du[i] = getDistance(u, i);
if (du[i] > diam)
{
diam = du[i];
v = i;
}
}
int best = 1e9+10;
for (int i = 0; i < n; i++)
{
if (i != u && i != v)
{
int dv = getDistance(v, i);
int k = (du[i] + dv - diam)/2;
best = min(best, max(du[i]-k, dv-k));
}
}
return -best;
}
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... |