# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218489 | 2020-04-02T08:12:17 Z | socho | Boxes with souvenirs (IOI15_boxes) | C++14 | 13 ms | 16000 KB |
#include "boxes.h" #include "bits/stdc++.h" using namespace std; const long long MXN = 1000005; long long n, k, l, h, pos[MXN], rpos[MXN]; long long dpleft[MXN]; long long dpright[MXN]; long long delivery(int N, int K, int L, int p[]) { for (int i=0; i<MXN; i++) { dpleft[i] = -1; dpright[i] = -1; } n = N; k = K; l = L; h = l/2; for (int i=0; i<n; i++) { pos[i] = p[i]; rpos[i] = L - p[i]; } long long best = LLONG_MAX; for (int i=0; i<n; i++) { dpleft[i] = pos[i] * 2; if (i - k >= 0) dpleft[i] += dpleft[i-k]; } for (int i=n-1; i>=0; i--) { dpright[i] = rpos[i] * 2; if (i + k < n) dpright[i] += dpright[i+k]; } // for (int i=0; i<n; i++) cout << dpleft[i] << ' '; cout << endl; // for (int i=0; i<n; i++) cout << dpright[i] << ' '; cout << endl; for (int i=0; i<n-1; i++) { best = min(best, dpleft[i] + dpright[i+1]); } for (int i=0; i<n-1; i++) { int unt = l; if (i >= 1) unt += dpleft[i-1]; if (i + k < n - 1) unt += dpright[i+k+1]; } return best; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 12 ms | 16000 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 13 ms | 16000 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 12 ms | 16000 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 12 ms | 16000 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 12 ms | 16000 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 12 ms | 16000 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |