# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1017482 | amirhoseinfar1385 | Boxes with souvenirs (IOI15_boxes) | C++17 | 440 ms | 293776 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;
const int maxn=10000000+10;
long long ps[maxn],suf[maxn],n,k,res,l;
long long delivery(int N, int K, int L, int p[]) {
n=N;
k=K;
l=L;
for(int i=0;i<n;i++){
long long ghabl=0;
if(i>=k){
ghabl=ps[i-k];
}
ps[i]=ghabl+p[i]+min(1ll*p[i],l-p[i]);
}
for(int i=n-1;i>=0;i--){
long long ghabl=0;
if(i+k<=n-1){
ghabl=suf[i+k];
}
suf[i]=ghabl+(l-p[i])+min(1ll*p[i],l-p[i]);
// cout<<i<<" "<<ps[i]<<" "<<suf[i]<<endl;
}
res=min(suf[0],ps[n-1]);
for(int i=0;i<n-1;i++){
res=min(res,1ll*ps[i]+suf[i+1]);
}
return res;
}
Compilation message (stderr)
# | 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... |