# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1168730 | anmattroi | Towns (IOI15_towns) | C++17 | 11 ms | 328 KiB |
#include "towns.h"
#include <bits/stdc++.h>
#define maxn 115
using namespace std;
int hubDistance(int N, int sub) {
int *cached = new int[N];
int mx = -1, nodeA = -1, nodeB = -1;
for (int i = 1; i < N; i++) {
int t = getDistance(0, i);
if (mx < t) {
mx = t;
nodeA = i;
}
}
for (int i = 0; i < N; i++)
if (i != nodeA) {
int t = getDistance(nodeA, i);
cached[i] = t;
if (mx < t) {
mx = t;
nodeB = i;
}
}
int tong = mx;
int ans = INT_MAX;
for (int i = 0; i < N; i++)
if (i != nodeA and i != nodeB) {
# | 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... |