# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
928539 | AlphaMale06 | 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 <bits/stdc++.h>
using namespace std;
long long dp[10000003], rdp[10000003];
long long delivery(int n, int k, int l, int a[]) {
sort(a, a+n);
for(int i=1; i<= n; i++)dp[i]=dp[i-min(i, k)]+min(l, 2*a[i-1]);
for(int i=n; i>=1; i--)rdp[i]=rdp[i+min(n+1-i, k)]+min(l, 2*(l-a[i-1]));
ll ans=min(rdp[1], dp[n]);
for(int i=1; i<n; i++)ans=min(ans, dp[i]+rdp[i+1]);
return ans;
}