# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288441 | shayan_p | Towns (IOI15_towns) | C++17 | 22 ms | 896 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<bits/stdc++.h>
#include "towns.h"
#define F first
#define S second
#define PB push_back
#define sz(s) (int(s.size()))
#define bit(n, k) (((n)>>(k))&1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
const int maxn = 1e5 + 10, mod = 1e9 + 7, inf = 1e9 + 7;
int n;
int ds[2][maxn], h[maxn], D[maxn];
int far(int u, int o){
ds[o][u] = 0;
for(int i = 0; i < n; i++){
if(i != u)
ds[o][i] = getDistance(u, i);
}
int mx = 0;
for(int i = 0; i < n; i++){
if(ds[o][mx] < ds[o][i])
mx = i;
}
return mx;
}
int hubDistance(int n, int sub){
::n = n;
int A = far(0, 0);
int B = far(A, 0);
far(B, 1);
vector<int> vec;
int R = inf;
for(int i = 0; i < n; i++){
h[i] = (ds[0][i] + ds[1][i] - ds[0][B]) / 2;
D[i] = ds[0][i] - h[i];
vec.PB(D[i]);
R = min(R, max(D[i], ds[0][B] - D[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... |