| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 669870 | alvingogo | Towns (IOI15_towns) | C++14 | 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 <bits/stdc++.h>
//#include <towns.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;
map<pair<int,int>,int> mp;
int f(int x,int y){
if(x==y){
return 0;
}
if(x>y){
swap(x,y);
}
if(mp.find({x,y})!=mp.end()){
return mp[{x,y}];
}
return mp[{x,y}]=getDistance(x,y);
}
int hubDistance(int n,int sub){
//int n=N;
int a=0;
for(int i=0;i<n;i++){
if(f(0,i)>f(0,a)){
a=i;
}
}
int b=a;
for(int i=0;i<n;i++){
if(f(a,i)>f(a,b)){
b=i;
}
}
map<int,pair<int,vector<int> > > m;
for(int i=0;i<n;i++){
if(i!=a && i!=b){
int d=(f(i,a)+f(i,b)-f(a,b))/2;
int x=f(i,a)-d;
m[x].fs=max(m[x].fs,d);
m[x].sc.push_back(i);
}
}
vector<int> g;
for(auto h:m){
g.push_back(h.fs);
}
int p=g.size();
vector<int> dis(p,0);
for(int i=0;i<p;i++){
dis[i]=max(dis[i],max(g[i],f(a,b)-g[i]));
for(int j=i+1;j<p;j++){
int u=g[j]-g[i];
dis[i]=max(dis[i],m[g[j]].fs+u);
dis[j]=max(dis[j],m[g[i]].fs+u);
}
}
int y=2e9;
for(int i=0;i<p;i++){
y=min(y,dis[i]);
}
return y;
}