| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 206056 | Segtree | 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"towns.h"
#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define all(x) x,begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod
int hubDistance(int N,int SUBTASK){
int ma=0,A=-1;
for(int i=0;i<N;i++){
int res=getDistance(0,i);
if(res>ma)res=ma,A=i;
}
int dista[110];
ma=0,B=-1;
for(int i=0;i<N;i++){
int res=getDistance(A,i);
dista[i]=res;
if(res>ma)res=ma,B=i;
}
int distb[110];
for(int i=0;i<N;i++){
int res=getDistance(B,i);
distb[i]=res;
}
int ab=dista[B];
int ans=1e9;
for(int i=0;i<N;i++)if(i!=A&&i!=B){
int ax=dista[i],bx=distb[i];
int q=(ax+bx-ab)/2;
int p=ax-q;
int r=bx-q;
chmin(ans,max(p,r));
}
return ans;
}