# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
615530 | 2022-07-31T10:19:35 Z | Apiram | Towns (IOI15_towns) | C++14 | 15 ms | 852 KB |
#include "towns.h" #include <bits/stdc++.h> using namespace std; int hubDistance(int N, int sub) { int root = 0; vector<int>dist(N); for (int i = 0;i<N;++i){ if (i == root)dist[i] = 0; else dist[i] = getDistance(i,root); } for (int i = 0;i<N;++i){ if (dist[i] > dist[root]){ root = i; } } for (int i = 0;i<N;++i){ if (i == root)dist[i] = 0; else dist[i] = getDistance(i,root); } int root2 = root; for (int i = 0;i<N;++i){ if (dist[i] > dist[root2])root2 = i; } int answer = dist[root2]; vector<int>dist2(N); for (int i = 0;i<N;++i){ if (i == root2){ dist2[i] = 0; } else{ dist2[i] = getDistance(root2,i); } } for (int i = 0;i<N;++i){ int x = (dist[i] + dist2[i] - dist[root2])/2; answer = min(answer,max(dist[i] - x,dist2[i] - x)); } return answer; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 340 KB | Output is correct |
2 | Correct | 15 ms | 704 KB | Output is correct |
3 | Correct | 1 ms | 308 KB | Output is correct |
4 | Correct | 14 ms | 824 KB | Output is correct |
5 | Correct | 12 ms | 852 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 344 KB | Output is correct |
2 | Correct | 10 ms | 724 KB | Output is correct |
3 | Correct | 13 ms | 852 KB | Output is correct |
4 | Correct | 13 ms | 840 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 12 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 11 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 9 ms | 352 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 10 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |