# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105177 | ly20 | 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 debug(args...) fprintf(stderr,args)
#define int long long
const int MAXN=11234567;
long long ida[MAXN],volta[MAXN];
int vlt[MAXN];
long long delivery(int n,int k,int l,int id[])
{
long long resp=MAXN*1123456789LL;
for(int i=n-1;i>=0;i--)
{
vlt[n-i-1]=id[i];
}
for(int i=0;i<n;i++)
{
long long p=2*id[i];
if(p>l)p=l;
if(i<k)ida[i]=p;
else ida[i]=ida[i-k]+p;
debug("ida[%d]=%lld\n",i,ida[i]);
}
for(int i=0;i<n;i++)
{
long long p=2*((long long)l-(long long)vlt[i]);
if(p>l)p=l;
if(i<k)volta[i]=p;
else volta[i]=volta[i-k]+p;
debug("vlt[%d]=%lld\n",i,volta[i]);
}
resp=min(resp,(volta[n-1],ida[n-1]));
for(int i=0;i<n-1;i++)
{
int v=n-i-2;
debug("ida=%d volta=%d\n",i,v);
resp=min(resp,ida[i]+volta[v]);
}
return resp;
}
/*int ps[MAXN];
int main()
{
int n,k,l;
scanf("%d %d %d",&n,&k,&l);
for(int i=0;i<n;i++)
{
scanf("%d",&ps[i]);
}
printf("%lld\n",delivery(n,k,l,ps));
}*/