# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102717 | wxh010910 | Towns (IOI15_towns) | C++17 | 33 ms | 1144 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;
int hubDistance(int N, int sub) {
vector<vector<int>> dist(2, vector<int>(N, 0));
int root = 0, left = 0, right = 0;
for (int i = 0; i < N; ++i) {
if (i != root) {
dist[0][i] = getDistance(root, i);
if (dist[0][i] > dist[0][left]) {
left = i;
}
}
}
for (int i = 0; i < N; ++i) {
if (i != left) {
dist[1][i] = getDistance(left, i);
if (dist[1][i] > dist[1][right]) {
right = i;
}
}
}
int limit = (dist[0][left] - dist[0][right] + dist[1][right]) >> 1;
vector<int> from(N, 0), all;
for (int i = 0; i < N; ++i) {
from[i] = (dist[1][i] - dist[0][i] + dist[0][left]) >> 1;
if (from[i] <= limit) {
all.push_back(from[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... |