# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20194 | 2016-03-06T09:18:54 Z | suhgyuho_william | Towns (IOI15_towns) | C++ | 21 ms | 4 KB |
#include "towns.h" #include <algorithm> using namespace std; int R; int a[150][150]; int hubDistance(int N, int sub) { int i,x; int v,big; for(i=1; i<N; i++) a[0][i] = a[i][0] = getDistance(0,i); big = 0; for(i=1; i<N; i++){ if(big < a[0][i]){ big = a[0][i]; v = i; } } for(i=1; i<N; i++){ if(i == v) continue; a[v][i] = a[i][v] = getDistance(i,v); } R = 0; for(i=1; i<N; i++){ if(i == v) continue; x = a[0][i]+a[v][i]-big; x /= 2; R = max(R,max(a[0][i]-x,a[v][i]-x)); } return R; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 20 ms | 0 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 19 ms | 2 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 2 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 21 ms | 2 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 4 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 4 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |