#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> f(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> f[i][j];
}
}
map<pair<int, int>, int> mp;
auto Ask = [&](int l, int r) {
if (l > r) {
swap(l, r);
}
if (l == r) {
return 0;
}
if (mp.count({l, r})) {
return mp[{l, r}];
}
return f[l][r];
int x;
cin >> x;
mp[{l, r}] = x;
return x;
};
int x = 0, y = 0;
for (int i = 1; i < n; i++) {
if (Ask(0, i) > Ask(0, x)) {
x = i;
}
}
for (int i = 0; i < n; i++) {
if (Ask(x, i) > Ask(x, y)) {
y = i;
}
}
vector<int> d;
vector<int> my(n);
for (int i = 0; i < n; i++) {
my[i] = (Ask(i, x) - Ask(i, 0) + Ask(0, x)) / 2;
d.push_back(my[i]);
}
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()));
int sz = (int) d.size();
vector<int> r(sz);
for (int i = 0; i < sz; i++) {
r[i] = max(d[i], Ask(x, y) - d[i]);
}
int mn = *min_element(r.begin(), r.end());
vector<int> cnt(sz);
for (int i = 0; i < n; i++) {
int idx = (int) (lower_bound(d.begin(), d.end(), my[i]) - d.begin());
cnt[idx] += 1;
}
vector<int> pref(sz);
for (int i = 0; i < sz; i++) {
if (i > 0) {
pref[i] = pref[i - 1];
}
pref[i] += cnt[i];
}
vector<int> cands;
for (int i = 0; i < sz; i++) {
if (r[i] == mn && max((i == 0 ? 0 : pref[i - 1]), pref[sz - 1] - pref[i]) <= n / 2) {
cands.push_back(i);
}
}
assert(cands.size() <= 1);
cout << mn << '\n';
return 0;
}
Compilation message
/usr/bin/ld: /tmp/ccQLMuQh.o: in function `main':
grader.c:(.text.startup+0x0): multiple definition of `main'; /tmp/ccRYBfhj.o:towns.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/ccQLMuQh.o: in function `main':
grader.c:(.text.startup+0x83): undefined reference to `hubDistance(int, int)'
collect2: error: ld returned 1 exit status
