# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
74200 | MKopchev | 도시들 (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>
using namespace std;
const int nmax=1e2+42;
int dist[nmax];
int hubDistance(int N,int sub)
{
for(int i=0;i<N;i++)
for(int j=i+1;j<N;j++)
{
int d=getDistance(i,j);
dist[i]=max(dist[i],d);
dist[j]=max(dist[j],d);
}
int mini=dist[0];
for(int i=1;i<N;i++)
{
mini=min(mini,dist[i]);
}
return mini;
}