# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
587608 | benson1029 | Towns (IOI15_towns) | C++14 | 32 ms | 896 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;
int dis0[200], disX[200], disY[200];
vector< pair<int,int> > mid2;
vector<int> mid;
int X, Y;
bool checkdiff(int a, int b) {
int ad = (disX[Y] + disX[a] + disY[a]) / 2 - disX[Y];
int bd = (disX[Y] + disX[b] + disY[b]) / 2 - disX[Y];
if(getDistance(a, b) == ad+bd) return true;
return false;
}
int hubDistance(int N, int sub) {
X = 1;
for(int i=1; i<N; i++) {
dis0[i] = getDistance(0, i);
if(dis0[i] > dis0[X]) {
X = i;
}
}
Y = 0;
for(int i=0; i<N; i++) {
if(i==X) continue;
disX[i] = getDistance(X, i);
if(disX[i] > disX[Y]) {
Y = i;
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... |