| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 216756 | LittleFlowers__ | Boxes with souvenirs (IOI15_boxes) | C++14 | 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;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))
#define gg exit(0);
//#define unx 1
#ifndef unx
#include "boxes.h"
#endif // unx
const int N=10000010;
long long f[N],g[N];
long long delivery(int n,int k,int l,int p[]){
long long ret=LLONG_MAX;
forinc(i,1,n) f[i]=f[max(0ll,i-k)]+2*p[i-1];
fordec(i,n,1) g[i]=g[min(n+1,i+k)]+2*(l-p[i-1]);
forinc(i,0,n){
ret=min(ret,f[i]+g[i+1]);
ret=min(ret,f[i]+g[min(n+1,i+k+1)]+l);
}
cout<<ret;
}
#ifdef unx
int p[10000010];
main(){
#define task "boxes"
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
int n,k,l; cin>>n>>k>>l;
forinc(i,1,n) cin>>p[i-1];
cout<<delivery(n,k,l,p)<<"\n";
}
#endif // unx