# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
234997 | dolphingarlic | Towns (IOI15_towns) | C++14 | 24 ms | 512 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 <vector>
inline int max(int X, int Y) { return (X > Y ? X : Y); }
struct Hub {
int dist_A, R;
Hub(int A = 1000001, int B = 1000001) {
dist_A = A;
R = max(A, B);
}
} hubs[2];
int hubDistance(int N, int sub) {
int to_0[110], A, to_A[110], B;
for (int i = 0, best_A = 0; i < N; i++) {
to_0[i] = getDistance(0, i);
if (to_0[i] > best_A) A = i, best_A = to_0[i];
}
for (int i = 0, best_B = 0; i < N; i++) {
to_A[i] = getDistance(A, i);
if (to_A[i] > best_B) B = i, best_B = to_A[i];
}
int hub_cnt = 0;
for (int i = 0; i < N; i++) {
int lca_to_A = (to_A[i] + to_A[0] - to_0[i]) / 2;
Hub potential_hub(lca_to_A, to_A[B] - lca_to_A);
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... |