Submission #1242800

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242800		abdelhakim	Boxes with souvenirs (IOI15_boxes)	C++20	100 / 100	341 ms	196112 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
long long delivery(int N, int K, int L, int p[])
{
    vector<ll> dpl(N);
    vector<ll> dpr(N);
    for (int i=0;i<N;i++)
    {
        if(i<K)
        {
            dpl[i]=p[i]+min(p[i],L-p[i]);
        }
        else dpl[i]=p[i]+min(p[i],L-p[i])+dpl[i-K];
    }
    for (int i=N-1;i>=0;i--)
    {
        if(i>=N-K)
        {
            dpr[i]=L-p[i]+min(p[i],L-p[i]);
        }
        else
        {
            dpr[i]=L-p[i]+min(p[i],L-p[i])+dpr[i+K];
        }
    }
    ll ans=min(dpl[N-1],dpr[0]);
    for (int i=0;i<N-1;i++)
    {
        ans=min(ans,dpl[i]+dpr[i+1]);
    }
    return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 30 / 30