# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167465 | 2019-12-08T15:52:19 Z | faremy | Towns (IOI15_towns) | C++14 | 27 ms | 1172 KB |
#include "towns.h" #include <algorithm> #include <iostream> const int MAXN = 110; int distToEnd[MAXN]; int hubDistance(int N, int sub) { int farthest = 0, end = 0; for (int iNode = 0; iNode < N; iNode++) { int dist = getDistance(0, iNode); if (dist > farthest) { farthest = dist; end = iNode; } } int diameter = 0, otherEnd = end; for (int iNode = 0; iNode < N; iNode++) { distToEnd[iNode] = getDistance(end, iNode); if (distToEnd[iNode] > diameter) { diameter = distToEnd[iNode]; otherEnd = iNode; } } int minMaxDist = diameter; for (int iNode = 0; iNode < N; iNode++) { int distToOth = getDistance(iNode, otherEnd); int half = (diameter + distToEnd[iNode] - distToOth) / 2; minMaxDist = std::min(minMaxDist, std::max(half, diameter - half)); } return minMaxDist; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 1016 KB | Output is correct |
2 | Correct | 17 ms | 760 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 21 ms | 1016 KB | Output is correct |
5 | Correct | 21 ms | 888 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 1016 KB | Output is correct |
2 | Correct | 16 ms | 896 KB | Output is correct |
3 | Correct | 21 ms | 888 KB | Output is correct |
4 | Correct | 21 ms | 888 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 764 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 22 ms | 1172 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 760 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 27 ms | 948 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |