# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
889935 | abcvuitunggio | Towns (IOI15_towns) | 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;
int dist[111][111];
int d(int u, int v){
if (u==v)
return 0;
if (u>v)
swap(u,v);
if (dist[u][v])
return dist[u][v];
return dist[u][v]=getDistance(u,v);
}
int hubDistance(int N, int sub){
memset(dist,0,sizeof(dist));
pair <int, int> mx={0,-1};
for (int i=0;i<N;i++)
mx=max(mx,{d(0,i),i});
int u=mx.second;
mx={0,-1};
for (int i=0;i<N;i++)
mx=max(mx,{d(u,i),i});
int v=mx.second;
int R=1e9,ch=1,cnt[4]={0,0,0,0};
for (int i=0;i<N;i++)
R=min(R,abs(d(i,u)-d(i,v)));
vector <int> a,b;
for (int i=0;i<N;i++){
int val=d(i,u)-d(i,v);
if (val<-R)
cnt[0]++;
if (val==-R)
a.push_back(i);
if (val==R)
b.push_back(i);
if (val>R)
cnt[3]++;
}
for (int i=0;i<4;i++)
if (cnt[i]>N/2)
ch=-1;
if (a.size()>N/2||b.size()?N/2)
ch=-1
return (R+d(u,v))/2*ch;
}