# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1080039 | Trumling | Towns (IOI15_towns) | C++14 | 21 ms | 1096 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 F first
#define S second
#define pb push_back
#define all(x) x.begin(),x.end()
#define INF 9999999999999
typedef long long ll;
int hubDistance(int N, int sub) {
ll n=N;
vector<vector<ll>>g(N,vector<ll>(N,-1));
ll maxi=-1;
pair<ll,ll>curr;
ll p1=0;
for(int j=1;j<n;j++)
{
ll R=getDistance(0,j);
g[0][j]=R;
g[j][0]=R;
if(maxi<R)
{
maxi=R;
p1=j;
}
}
curr={0,p1};
for(int i=1;i<n;i++)
if(i!=p1)
{
ll R=getDistance(i,p1);
g[i][p1]=R;
g[p1][i]=R;
if(maxi<R)
{
maxi=R;
curr={p1,i};
}
}
ll ans=INF;
for(int i=0;i<n;i++)
if(i!=curr.F && i!=curr.S)
{
if(g[i][curr.F]==-1)
{
ll R=getDistance(i,curr.F);
g[i][curr.F]=R;
g[curr.F][i]=R;
}
if(g[i][curr.S]==-1)
{
ll R=getDistance(i,curr.S);
g[i][curr.S]=R;
g[curr.S][i]=R;
}
ll f=(g[i][curr.F] + g[i][curr.S] - maxi)/2;
ans=min(ans,max(g[i][curr.F]-f,g[i][curr.S]-f));
}
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... |