# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
718426 | pafag93064 | 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>
using namespace std;
int hubDistance(int N,int sub) {
int maxd=0;
for(int i=0;i<N;i++) {
for(int j=0;j<i;j++) {
maxd=max(maxd,getDistance(i,j));
}
}
return maxd/2;
}