| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 798493 | Username4132 | 도시들 (IOI15_towns) | C++14 | 12 ms | 1092 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>
using namespace std;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define forsn(i, s, n) for(int i=s; i<(int)n; ++i)
const int MAXN = 120;
int n, d1[MAXN], d2[MAXN];
int hubDistance(int N, int sub) {
n=N;
int mx = -1, u, v;
forsn(i, 1, n){
int dis = getDistance(0, i);
if(dis>mx) mx=dis, u=i;
}
mx=-1;
forn(i, n) if(i!=u){
d1[i]=getDistance(u, i);
if(d1[i]>mx) mx=d1[i], v=i;
}
int mn=1000000000;
forn(i, n) if(i!=v){
d2[i]=getDistance(v, i);
mn=min(mn, abs(d1[i]-d2[i]));
}
return (d1[v]+mn)>>1;
}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... | ||||
