# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
765892 | raysh07 | Boxes with souvenirs (IOI15_boxes) | C++17 | 0 ms | 0 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;
#define INF (long long) 1e18
long long delivery(int N, int K, int L, int a[]) {
int n = N;
sort(a, a + n);
vector<long long> dp1(n + 2, INF), dp2(n + 2, INF);
dp1[0] = 0;
dp2[n + 1] = 0;
for (int i = 1; i <= n; i++){
if (i <= k) dp1[i] = 2 * (a[i - 1]);
else dp1[i] = dp1[i - k] + 2 * (a[i - 1]);
}
for (int i = n; i >= 1; i--){
if (i + k <= n + 1) dp2[i] = dp2[i + k] + 2 * (L - a[i - 1]);
else dp2[i] = 2 * (L - a[i - 1]);
}
long long ans = INF;
if (n <= k) ans = L;
for (int i = 0; i <= n; i++) ans = min(ans, dp1[i] + dp2[i + 1]);
for (int i = 0; i <= n; i++){
ans = min(ans, dp1[i] + L + dp2[i + 1 + k]);
}
return ans;
}