# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134586 | 2019-07-23T04:49:43 Z | StevenH | Boxes with souvenirs (IOI15_boxes) | C++14 | 2 ms | 380 KB |
#include "boxes.h" long long delivery(int N, int K, int L, int p[]) { if(K==1) { int ans=0; for(int i=0;i<N;i++) { if(p[i]>N/2) ans+=N-p[i]; else ans+=p[i]; } return ans; } else if(K==N) { int mx=-1; int mn=999999999; for(int i=0;i<N;i++) { if(p[i]>mx)mx=p[i]; if(p[i]<mn)mn=p[i]; } if(mx>N/2 && mn<N/2)return N; else if(mx<N/2 && mn<N/2)return mx*2; else if(mx>N/2 && mn>N/2)return (N-mn)*2; else return N; } //return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Incorrect | 2 ms | 376 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 380 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |