| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1085357 | guagua0407 | Sorting (IOI15_sorting) | C++17 | 0 ms | 0 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
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int hubDistance(int N, int sub) {
int n=N;
vector<int> dis(n);
for(int i=0;i<n;i++){
dis[i]=getDistance(0,i);
}
int x=max_element(all(dis))-dis.begin();
for(int i=0;i<n;i++){
dis[i]=getDistance(x,i);
}
int y=max_element(all(dis))-dis.begin();
vector<int> dis2(n);
for(int i=0;i<n;i++){
dis2[i]=getDistance(y,i);
}
vector<int> vec;
for(int i=0;i<n;i++){
vec.push_back(dis[i]-(dis[i]+dis2[i]-dis[y])/2);
}
sort(all(vec));
int R=dis[y];
int ans=R;
for(auto v:vec){
ans=min(ans,max(v,R-v));
}
return ans;
}