# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134867 | nvmdava | Towns (IOI15_towns) | C++17 | 22 ms | 504 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>
#define ff first
#define ss second
using namespace std;
int d[2][115], v;
map<int, int> cntr;
int hubDistance(int N, int sub) {
memset(d, 0, sizeof d);
cntr.clear();
for(int i = 0; i < N; i++)
if(d[0][v] < (d[0][i] = getDistance(0, i)))
v = i;
int T = d[0][v], D = 0;
for(int i = 0; i < N; i++)
D = max(D, d[1][i] = getDistance(v, i));
int r = 1000000000;
for(int i = 0; i < N; i++){
int s = (T + d[1][i] - d[0][i]) >> 1;
cntr[s]++;
r = min(r, max(s, D - s));
}
int chk = -1, l = 0;
for(auto& x : cntr){
if(l <= N / 2 && N - (l += x.ss) <= N / 2){
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... |