# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
30538 | 2017-07-24T13:52:47 Z | kavun | Boxes with souvenirs (IOI15_boxes) | C++14 | 2 ms | 376 KB |
#include "boxes.h" #include <bits/stdc++.h> #define pb push_back using namespace std; long long n,l,k,ans = 1e9, cw[10000010], ccw[10000010]; long long delivery(int N, int K, int L, int p[]) { n = N; k = K; for(int i = 0; i < k; i++) cw[i] = 2*p[i]; for(int i = k; i < n; i++) cw[i] = cw[i-k] + 2*p[i]; for(int i = n-1; i >= n-k; i--) ccw[i] = 2*(L-p[i]); for(int i = n-k-1; i >= 0; i--) ccw[i] = ccw[i+k] + 2*(L-p[i]); for(int i = 0; i < n; i++) if(p[i+k] > L/2) ans = min(ans,cw[i] + L + 2*ccw[i+k+1]); return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 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 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 256 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |