# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
432605 | 2021-06-18T11:33:40 Z | daniel920712 | Towns (IOI15_towns) | C++14 | 24 ms | 964 KB |
#include "towns.h" #include <iostream> using namespace std; int all[205][205]={0}; int hubDistance(int N, int sub) { int i,j,k,ans=0,a,b,c; for(i=0;i<N;i++) { for(j=i+1;j<N;j++) all[i][j]=all[j][i]=getDistance(i,j); } for(i=0;i<N;i++) { for(j=i+1;j<N;j++) { for(k=j+1;k<N;k++) { a=all[i][j]; b=all[i][k]; c=all[j][k]; ans=max(ans,(a+b+c)/2-a); ans=max(ans,(a+b+c)/2-b); ans=max(ans,(a+b+c)/2-c); } } } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 24 ms | 964 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 23 ms | 844 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 332 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 312 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |