# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
556766 | blue | Towns (IOI15_towns) | C++17 | 16 ms | 956 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 <vector>
#include <cmath>
#include <set>
#include <iostream>
using namespace std;
namespace
{
using vi = vector<int>;
}
int hubDistance(int N, int sub)
{
vi dist0(N);
for(int i = 0; i < N; i++)
dist0[i] = getDistance(0, i);
int S = 0;
for(int i = 0; i < N; i++)
if(dist0[i] > dist0[S])
S = i;
vi distS(N);
int T = 0;
for(int i = 0; i < N; i++)
{
distS[i] = getDistance(S, i);
if(distS[i] > distS[T])
T = i;
}
vi distT(N);
for(int i = 0; i < N; i++)
distT[i] = getDistance(T, i);
int ST = distS[T];
int res = 5'000'000;
for(int i = 0; i < N; i++)
res = min(res, max(distS[i], distT[i]) - (distS[i] + distT[i] - distS[T])/2);
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... |