| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1357062 | enzy | Towns (IOI15_towns) | C++20 | 9 ms | 460 KiB |
#include "towns.h"
#include<bits/stdc++.h>
using namespace std;
const int inf=1e9+7;
int hubDistance(int n, int sub){
int best=0, id=0;
for(int i=1;i<n;i++){
int at=getDistance(0,i);
if(at>best){
best=at;
id=i;
}
}
vector<int>d1(n), d2(n);
for(int i=0;i<n;i++) d1[i]=getDistance(id,i);
int f1=id, f2=0; best=0;
for(int i=0;i<n;i++){
if(d1[i]>best){
best=d1[i];
f2=i;
}
}
for(int i=0;i<n;i++) d2[i]=getDistance(f2,i);
int r=inf;
for(int i=0;i<n;i++){
int x=abs(d1[i]-d2[i])+best;
r=min(r,x/2);
}
return r;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
