# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
617679 | chirathnirodha | Towns (IOI15_towns) | C++17 | 14 ms | 836 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;
#define PB push_back
#define F first
#define S second
int hubDistance(int N, int sub) {
int n=N;
pair<int,int> maxdis={-1,-1};
for(int i=0;i<n;i++){
int x=getDistance(0,i);
if(x>maxdis.F)maxdis={x,i};
}
int a=maxdis.S;
maxdis={-1,-1};
int dista[n],distb[n];
for(int i=0;i<n;i++){
int x=getDistance(a,i);dista[i]=x;
if(x>maxdis.F)maxdis={x,i};
}
int b=maxdis.S;
int dia=maxdis.F;
int ans=dia;
for(int i=0;i<n;i++)distb[i]=getDistance(i,b);
for(int i=0;i<n;i++){
int itodia=(dista[i]+distb[i]-dia)/2;
ans=min(ans,max(dista[i]-itodia,distb[i]-itodia));
}
return ans;
}
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... |