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[]) {
int n=N,k=K;
long long l[n+1],r[n+1];
l[0]=0;
for(int i=0;i<n;i+=k){
for(int j=i+1;j<=n&&j<=i+k;j++){
l[j]=l[i]+min(p[j-1]*2,L);
}
}
r[0]=0;
for(int i=0;i<n;i+=k){
for(int j=i+1;j<=n&&j<=i+k;j++){
r[j]=r[i]+min((L-p[n-j])*2,L);
}
}
long long ans=LLONG_MAX;
for(int i=0;i<=n;i++){
ans=min(ans,l[i]+r[n-i]);
}
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... |