# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
427142 | ollel | Towns (IOI15_towns) | C++17 | 0 ms | 0 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 <iostream>
// #include "towns.h"
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define pb push_back
#define lso(x) x&(-x)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int n, s;
//
// int getDistance(int i, int j) {
// cout << i << " " << j << endl;
// int ans;
// cin >> ans;
// return ans;
// }
int hubDistance(int N, int S) {
n = N; s = S;
vvi d(n, vi(n));
rep(i,0,n) d[i][i] = 0;
rep(i, 0, n) rep(j, i + 1, n) {
d[i][j] = d[j][i] = getDistance(i, j);
}
int a, b, m = 0;
rep(i,0,n) rep(j,i+1,n) {
if (d[i][j] > m) {a = i; b = j; m = d[i][j];}
}
int ab = d[a][b];
rep(k, 1, ab) {
int s = ab - k;
rep(c,0,n) {
if ((c == a) || (c == b)) continue;
if (d[a][c] - k == d[b][c] - s) return max(s, k);
}
}
}
//
// int main() {
// int n; cin >> n;
// cout << hubDistance(n, 0);
// }