#include "towns.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 120;
const int inf = 0x3f3f3f3f;
int qs[maxn][maxn];
vector<int> v;
vector<int> li, buk;
int n;
int query(int a, int b) {
assert(a < n && b < n && a >= 0 && b >= 0);
if (a > b) swap(a, b);
if (qs[a][b] == -1) qs[a][b] = getDistance(a, b);
return qs[a][b];
}
int a, b;
int B;
bool subtree(int x, int y) {
int xd = (query(a, x) + query(b, x) - query(a, b)) / 2;
int yd = (query(a, y) + query(b, y) - query(a, b)) / 2;
return (xd + yd) > query(x, y);
}
int hubDistance(int n, int sub) {
//for (int i = 0; i < n * n; i++) getdistance(0, 1);
::n = n;
memset(qs, -1, sizeof qs);
a = b = B = 0;
//memset(sol, inf, sizeof sol);
for (int i = 0; i < n; i++)
qs[i][i] = 0;
a = 0, b = 0;
for (int i = 0; i < n; i++)
if (query(0, a) < query(0, i)) a = i;
for (int i = 0; i < n; i++)
if (query(a, b) < query(a, i)) b = i;
B = b; b = 0;
int hu = -1, out = inf;
for (int i = 0; i < n; i++) {
int cd = (query(a, i) + query(b, i) - query(a, b)) / 2;
int ad = query(a, i) - cd;
int bd = query(a, B) - ad;
if (out > max(ad, bd)) out = max(ad, bd), hu = ad;
}
int lef = 0, rig = 0;
v.clear();
for (int i = 0; i < n; i++) {
int cd = (query(a, i) + query(b, i) - query(a, b)) / 2;
int ad = query(a, i) - cd;
if (ad < hu) lef++;
else if (ad > hu) rig++;
else v.push_back(i);
}
if (max(lef, rig) > n / 2) return -out;
li.clear();
buk.clear();
if (v.size() == 0) {
if (max(lef, rig) > n / 2) return -out;
else return out;
}
li.push_back(v[0]);
for (int i = 1; i < v.size(); i++) {
if (subtree(v[i], li.back())) buk.push_back(v[i]);
else {
li.push_back(v[i]);
if (!buk.empty()) {
li.push_back(buk.back());
buk.pop_back();
}
}
}
int cnt = 0;
int kan = li.back();
while (li.size() > 0) {
if (subtree(li.back(), kan)) {
if (li.size() == 1) {
buk.push_back(li.back());
li.pop_back();
} else {
li.pop_back();
li.pop_back();
cnt++;
}
} else {
if (buk.empty()) return out;
else {
li.pop_back();
buk.pop_back();
}
}
}
cnt += buk.size();
if (cnt > n / 2) return -out;
else return out;
}
