# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
899316 | 2024-01-05T18:30:43 Z | aykhn | Boxes with souvenirs (IOI15_boxes) | C++17 | 1 ms | 500 KB |
#include "boxes.h" #include <bits/stdc++.h> using namespace std; long long delivery(int N, int K, int L, int P[]) { vector<int> v; v.push_back(0); for (int i = (P[0] == 0); i < N; i++) v.push_back(P[i]); int p[N + 5], s[N + 5]; p[0] = 0; for (int i = 1; i < v.size(); i++) p[i] = p[max(0, i - K)] + v[i] * 2; s[v.size()] = 0; for (int i = (int)v.size() - 1; i >= 0; i--) s[i] = s[min((int)v.size(), i + K)] + 2 * (L - v[i]); int res = min(p[(int)v.size() - 1], s[0]); if (K >= N) res = min(res, L); for (int i = 0; i < v.size(); i++) { res = min(res, p[i] + s[i + 1]); res = min(res, p[i] + s[min((int)v.size(), i + K + 1)] + L); } return res; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Incorrect | 1 ms | 500 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |