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 ll long long
ll delivery(int n, int k, int l, int a[])
{
ll left[n+1], right[n+1];
left[0]=right[0]=0ll;
for(int i = 1; i <= n; i++)
{
left[i] = 2*a[i-1];
if(i>=k)left[i] += left[i-k];
} reverse(a, a+n);
for(int i = 1; i <= n; i++)
{
right[i] = 2*(l-a[i-1]);
if(i>=k)right[i]+=right[i-k];
}
ll ans = 10000000000;
for(int i = 0; i <= n; i++)
ans = min(ans, left[i]+right[n-i]);
for(int i = 0; i <= n-k; i++)
ans = min(ans, left[i]+right[n-i-k]+l);
return ans;
}
# | 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... |