# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134756 | tinjyu | Boxes with souvenirs (IOI15_boxes) | C++14 | 2 ms | 376 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 <iostream>
long long int n,k,l,sum[10000005][2];
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
int mid=n;
n=N;
k=K;
l=L;
for(int i=0;i<n;i++)
{
if(l/2<=p[i+1])
{
mid=p[i];
break;
}
}
long long tmp=0;
for(int i=mid-1;i>=0;i--)
{
if((i-mid)%k==0)tmp+=p[i];
sum[i][0]=tmp;
}
for(int i=mid;i<n;i++)
{
if((i-mid)%k==0)tmp+=p[i];
sum[i][1]=tmp;
}
long long int ans=sum[mid-1][0]+sum[n-1][1];
for(int i=mid;i>=mid-k && i>=0;i--)
{
tmp=sum[i][0];
if(i+k<n)tmp+=sum[i+k][1];
tmp+=l;
ans=min(tmp,ans);
}
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... |