Submission #1276886

#	Time	Username	Problem	Language	Result	Execution time	Memory
1276886		papaulo	Boxes with souvenirs (IOI15_boxes)	C++20	100 / 100	351 ms	196760 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define MAXN 10100100
ll dpl[MAXN];
ll dpr[MAXN];

void getDp(int N, int K, int p[], ll *dp) {
    dp[0]=0;
    for(int i=1;i<=N;i++) {
        dp[i]=dp[max(0, i-K)]+2LL*p[i-1];
    }
}

ll delivery(int N, int K, int L, int p[]) {
    getDp(N, K, p, dpl);
    reverse(p, p+N);
    for(int i=0;i<N;i++) p[i]=L-p[i];
    getDp(N, K, p, dpr);
    for(int i=K;i<=N;i++) {
        dpr[i]=min(dpr[i], dpr[i-K]+L);
    }
    ll ans=1e18L;
    for(int i=0;i<=N;i++) {
        ans=min(ans, dpl[i]+dpr[N-i]);
    }
    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