#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
int i;
vector<long long> a,b;
long long delivery(int n, int k, int l, int p[]) {
a.push_back(0);
b.push_back(0);
for(i=0;i<n;i++) a.push_back(min(p[i]*2,l)),p[i]=l-p[i];
for(i=n-1;i>=0;i--) b.push_back(min(p[i]*2,l));
for(i=0;i<=n;i++){
if(i>=k){
a[i]+=a[i-k];
b[i]+=b[i-k];
}
}
long long ans=1e15;
for(i=0;i<n;i++)ans=min(ans,a[i]+b[n-i]);
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
296 KB |
Output is correct |
3 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
276 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |