# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
799893 | Ronin13 | 도시들 (IOI15_towns) | C++17 | 29 ms | 24552 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 ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define ull unsigned ll
using namespace std;
const int nmax = 1000001;
vector <vector <int> > vec(nmax);
int hubDistance(int n, int sub) {
int A;
int d[n][2];
d[0][0] = 0;
A = 0;
for(int i = 1; i < n; i++){
d[i][0] = getDistance(0, i);
if(d[i][0] > d[A][0]){
A = i;
}
}
int diam = 0;
d[A][1] = 0;
for(int i = 0; i < n; i++){
if(A != i)
d[i][1] = getDistance(A, i);
diam = max(d[i][1], diam);
}
//cout << diam;
int r = 1e9 + 1;
for(int i = 0; i < n; i++){
int a = d[i][1] + d[0][1] - d[i][0]; a >>= 1;
if(a * 2 >= diam){
//vec[a].pb(i);
}
r = min(r, max(diam - a, a));
}
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... |