# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
399936 | bigg | Towns (IOI15_towns) | C++14 | 20 ms | 452 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 = 1e6;
int dist[5][MAXN];
pair<int, int> p1, p2;
int hubDistance(int N, int sub) {
for(int i = 1; i < N; i++){
int d = getDistance(0, i);
if(d > p1.second) p1 = {i,d};
}
for(int i = 0; i < N; i++){
dist[0][i] = getDistance(i, p1.first);
if(dist[0][i] > p2.second) p2 = { i, dist[0][i]};
}
for(int i = 0; i < N; i++){
dist[1][i] = getDistance(i, p2.first);
}
int ans = 1e9 + 10;
int diam = dist[0][p2.first];
for(int i = 0; i < N; i++) ans = min(ans, (diam + abs(dist[0][i] - dist[1][i]))/2);
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... |