# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
207276 | AQT | Towns (IOI15_towns) | C++14 | 31 ms | 376 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;
int dist[2][200];
int hubDistance(int N, int sub){
int d1 = 0, d2 = 0;
for(int i = 1; i<N; i++){
dist[0][i] = getDistance(0, i);
if(dist[0][i] > dist[0][d1]){
d1 = i;
}
}
for(int i = 0; i<N; i++){
dist[1][i] = getDistance(d1, i);
if(dist[1][i] > dist[1][d2]){
d2 = i;
}
}
int dia = dist[1][d2];
int ans = dia;
for(int i = 0; i<N; i++){
int k = (dist[0][d1] + dist[0][i] - dist[1][i])/2;
if(abs(ans-dia/2) > abs(k-dia/2)){
ans = k;
}
}
return min(ans, dia-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... |