Submission #565373

#	Time	Username	Problem	Language	Result	Execution time	Memory
565373		n0sk1ll	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	1 ms	340 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;
long long int typedef li;

li dp[10000007];
li dpr[10000007];

long long delivery(int n, int k, int L, int p[])
{
    for (int i=1;i<=n;i++) dp[i]=dp[max(0,i-k)]+2*p[i-1];
    for (int i=n;i>=1;i--) dpr[i]=dpr[min(n+1,i+k)]+2*(L-p[i-1]);

    li ans=1e18;
    for (int i=1;i<=n+1;i++) ans=min(ans,dp[i-1]+dpr[i]);
    for (int i=k;i<=n+1;i++) ans=min(ans,dp[i-k]+dpr[i]+L);
    return ans;
}

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