# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
432633 | daniel920712 | 도시들 (IOI15_towns) | C++14 | 1076 ms | 20612 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 <iostream>
#include <map>
#include <set>
using namespace std;
int all[205][205]={0};
map < int , set < int > > how[205];
int hubDistance(int N, int sub)
{
int i,j,k,ans=2e9,a,b,c,x,y,z;
for(i=0;i<N;i++)
{
for(j=i+1;j<N;j++) all[i][j]=all[j][i]=getDistance(i,j);
}
for(i=0;i<N;i++)
{
for(j=i+1;j<N;j++)
{
for(k=j+1;k<N;k++)
{
a=all[i][j];
b=all[i][k];
c=all[j][k];
z=(a+b+c)/2-a;
y=(a+b+c)/2-b;
x=(a+b+c)/2-c;
how[i][x].insert(x);
how[i][x].insert(y);
how[i][x].insert(z);
how[j][y].insert(x);
how[j][y].insert(y);
how[j][y].insert(z);
how[k][z].insert(x);
how[k][z].insert(y);
how[k][z].insert(z);
}
}
}
for(i=0;i<N;i++)
{
for(auto j:how[i]) ans=min(ans,*prev(j.second.end()));
}
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... |