# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
778412 | danikoynov | Towns (IOI15_towns) | C++14 | 16 ms | 900 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 "towns.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 120;
int dist[maxn];
int hubDistance(int N, int sub)
{
int v = 0, u = -1, best = 0;
for (int i = 1; i < N; i ++)
{
int d = getDistance(i, 0);
if (u == -1 || d > best)
{
best = d;
u = i;
}
}
dist[0] = best;
for (int i = 1; i < N; i ++)
{
if (i != u)
{
int d = getDistance(i, u);
dist[i] = d;
if (d > best)
{
best = d;
v = i;
}
}
}
int ans = 1e9;
for (int i = 0; i < N; i ++)
{
if (i == v || i == u)
continue;
int df = getDistance(v, i), tf = dist[i];
int diff = abs(df - tf);
ans = min(ans, (best - diff) / 2 + diff);
}
return ans;
}
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... |