# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
553694 | keta_tsimakuridze | Towns (IOI15_towns) | C++17 | 15 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 "towns.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 505;
ll d[2][N];
int hubDistance(int n, int sub) {
int U = 0, V = 0;
for(int i = 0; i < n; i++) {
d[0][i] = getDistance(0, i);
if(d[0][i] >= d[0][U]) U = i;
}
for(int i = 0; i < n; i++) {
d[1][i] = getDistance(U, i);
if(d[1][i] >= d[1][V]) V = i;
}
vector<ll> v;
ll Distance = 0;
for(int i = 0; i < n; i++) {
ll D = (d[1][i] + d[0][i] - d[0][U]) / 2;
D = d[1][i] - D;
v.push_back(D);
if(i == V) Distance = D;
}
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
ll R = 1e18;
for(int i = 0; i < v.size(); i++) {
if(v[i] > Distance) break;
ll x = (d[1][V] + d[0][V] - d[0][U]) / 2 + Distance - v[i];
R = min(R, max(v[i], x));
}
return R;
}
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... |