# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
832616 | 2023-08-21T12:40:14 Z | aymanrs | Towns (IOI15_towns) | C++14 | 15 ms | 948 KB |
#include "towns.h" #include <bits/stdc++.h> using namespace std; int hubDistance(int N, int sub) { int d[N][N]; int wi = 0, wj = 1, m = 0; for(int i = 0;i < N;i++) { d[i][i] = 0; for(int j = i+1;j < N;j++) { d[i][j] = d[j][i] = getDistance(i, j); if(d[i][j] > m){ m = d[i][j]; wi = i; wj = j; } } } for(int i = 0;i < N;i++){ if(i == wi || i == wj) continue; int dlca = (d[i][wi]+d[i][wj]-d[wi][wj])/2; m = min(m, max(d[i][wi]-dlca, d[i][wj]-dlca)); } return m; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 852 KB | Output is correct |
2 | Correct | 10 ms | 748 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 15 ms | 948 KB | Output is correct |
5 | Correct | 13 ms | 868 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 11 ms | 852 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |