# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
60170 | istlemin | Towns (IOI15_towns) | C++14 | 34 ms | 3132 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 "towns.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = a; i<int(b);++i)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define trav(a,c) for(auto a: c)
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;
ll n;
pii getFurthest(ll v){
ll furthest = 0;
ll mx = 0;
rep(i,0,n){
ll dist = getDistance(v,i);
if(dist>mx){
mx = dist;
furthest = i;
}
}
return {furthest,mx};
}
int hubDistance(int N, int sub) {
n = N;
ll diaA = getFurthest(0).first;
pii tmp = getFurthest(diaA);
ll diaB = tmp.first;
ll diameter = tmp.second;
map<ll,ll> pointsOnDiameter;
rep(i,0,n){
if(i==diaA||i==diaB) continue;
ll distA = getDistance(i,diaA);
ll distB = getDistance(i,diaB);
ll distFromDiameter = (distA+distB-diameter)/2;
pointsOnDiameter[distA-distFromDiameter]++;
}
ll minR = 1e18;
ll center = 0;
trav(x,pointsOnDiameter){
ll currR = max(x.first,diameter-x.first);
if(currR<minR){
center = x.first;
minR = currR;
}
}
return minR;
//if(pointsOnDiameter[center]<=n/2) return
}
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... |