# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
440312 | ToroTN | Boxes with souvenirs (IOI15_boxes) | C++14 | 1 ms | 332 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;
#include "boxes.h"
long long n,m,l,a[10000005],dp1[10000005],dp2[10000005],ans=1e18;
long long delivery(int N, int K, int L, int p[]) {
n=N;
m=K;
l=L;
for(int i=1;i<=n;i++)
{
a[i]=p[i];
}
dp1[0]=0;
dp2[0]=0;
for(int i=1;i<min(n,m);i++)
{
dp1[i]=min(l,2*(long long)i);
}
for(int i=m;i<n;i++)
{
dp1[i]=dp1[i-m]+min(l,2*(long long)i);
}
for(int i=n-1;i>max((long long)0,n-m+1);i--)
{
dp2[i]=min(l,(n-(long long)i)*2);
}
for(int i=n-m;i>=0;i--)
{
dp2[i]=dp2[i+m]+min(l,2*(n-(long long)i));
}
ans=min(ans,dp1[n-1]+dp2[0]);
for(int i=0;i<n-1;i++)
{
ans=min(ans,dp1[i]+dp2[i+1]);
}
return ans;
}
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... |