| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 126091 | baluteshih | Towns (IOI15_towns) | C++14 | 21 ms | 1192 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>
#define pb push_back
#define ET cout << "\n"
#define ALL(v) v.begin(),v.end()
#define MP make_pair
#define F first
#define S second
#define MEM(i,j) memset(i,j,sizeof i)
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int INF=1e9;
int hubDistance(int N, int sub)
{
vector<int> dis(N,0),a(N,0),b(N,0);
int x,y,R=INF;
for(int i=1;i<N;++i)
dis[i]=getDistance(0,i);
x=max_element(ALL(dis))-dis.begin();
for(int i=0;i<N;++i)
if(i!=x)
a[i]=getDistance(x,i);
y=max_element(ALL(a))-a.begin();
for(int i=0;i<N;++i)
if(i!=y)
b[i]=getDistance(y,i);
for(int i=0;i<N;++i)
R=min(R,abs(a[i]-b[i]));
return R;
}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... | ||||
