# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
484736 | imachug | Boxes with souvenirs (IOI15_boxes) | C++17 | 2087 ms | 29476 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
long long delivery(int n, int k, int l, int p[]) {
vector<long long> dp_left(n + 1, 1e18);
dp_left[0] = 0;
for(int i = 1; i <= n; i++) {
dp_left[i] = dp_left[max(0, i - k)] + 2 * p[i - 1];
}
vector<long long> dp_right(n + 1, 1e18);
dp_right[n] = 0;
for(int i = n - 1; i >= 0; i--) {
dp_right[i] = dp_right[min(n, i + k)] + 2 * (l - p[i]);
}
long long ans = 1e18;
for(int i = 0; i <= n; i++) {
for(int j = i; j <= n; j++) {
ans = min(ans, dp_left[i] + dp_right[j] + (long long)(j - i + k - 1) / k * l);
}
}
return ans;
if(k == 1) {
long long ans = 0;
for(int i = 0; i < n; i++) {
ans += min(p[i] * 2, (l - p[i]) * 2);
}
return ans;
}
if(k == n) {
long long ans = l;
for(int i = -1; i < n; i++) {
ans = min(ans, (long long)(i == -1 ? 0 : p[i] * 2) + (long long)(i == n - 1 ? 0 : (l - p[i + 1]) * 2));
}
return ans;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |