# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
74225 | MKopchev | Towns (IOI15_towns) | C++14 | 28 ms | 652 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"
using namespace std;
const int nmax=1e2+42;
int dist[nmax][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][j]=d;
dist[j][i]=d;
}
int p=0,q=0;
for(int i=0;i<N;i++)
for(int j=0;j<N;j++)
if(dist[p][q]<dist[i][j])p=i,q=j;
int mini=1e9;
for(int k=0;k<N;k++)
{
int n1=(dist[p][q]+dist[k][p]-dist[k][q])/2;
mini=min(mini,max(n1,dist[p][q]-n1));
}
return mini;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |