# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
669982 | alvingogo | 도시들 (IOI15_towns) | C++14 | 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 "towns.h"
using namespace std;
map<pair<int,int>,int> mp;
int qt=0;
int f(int x,int y){
if(x==y){
return 0;
}
if(x>y){
swap(x,y);
}
if(mp.find({x,y})!=mp.end()){
return mp[{x,y}];
}
qt++;
return mp[{x,y}]=getDistance(x,y);
}
int hubDistance(int n, int sub) {
vector<int> dist0(n);
for (int i = 1; i < n; ++i) {
dist0[i] = f(0,i);
}
int a = max_element(dist0.begin(), dist0.end()) - dist0.begin();
vector<int> dist(n);
dist[0] = dist0[a];
for (int i = 1; i < n; ++i) {
dist[i] = i == a ? 0 : f(i,a);
}
int b = max_element(dist.begin(), dist.end()) - dist.begin();
vector<int> pos(n);
pos[0] = (dist0[a] - dist0[b] + dist[b]) >> 1;
for (int i = 1; i < n; ++i) {
pos[i] = min(pos[0], (dist0[a] - dist0[i] + dist[i]) >> 1);
}
int ans = numeric_limits<int>::max();
map<int, vector<int>> mp;
for (int i = 0; i < n; ++i) {
ans = min(ans, max(pos[i], dist[b] - pos[i]));
mp[pos[i]].push_back(i);
}
vector<int> dis2(n);
for(auto h:mp){
for(auto z:h.sc){
dis2[z]=f(i,z)-pos[i]+abs(mp,h.fs);
}
}
int at=1;
vector<int> vis(n),pp(n);
int cnt=0,lo=0;
for(int i=0;i<n;i++){
int u=0;
for(int j=0;j<n;j++){
if(f(i,j)!=dis2[i]+dis2[j]){
u++;
}
}
if(u>n/2){
at=-1;
}
//cout << i << " " << u << "\n";
}
return at*ans;
}