Submission #1217175

#	Time	Username	Problem	Language	Result	Execution time	Memory
1217175		takoshanava	Boxes with souvenirs (IOI15_boxes)	C++20	10 / 100	0 ms	328 KiB

boxes

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

const long long INF = LLONG_MAX / 4;
static long long dp1[10000005], dp2[10000005];

long long delivery(int N, int K, int L, int pos[]) {
    dp1[0] = 0;
    for (int i = 1; i <= N; i++) {
        long long cost_cw = 2LL * pos[i-1];
        dp1[i] = dp1[i-1] + cost_cw;
        if (i >= K)
            dp1[i] = min(dp1[i], dp1[i-K] + cost_cw);
    }

    dp2[0] = 0;
    for (int i = 1; i <= N; i++) {
        long long cost_ccw = 2LL * (L - pos[N - i]);
        dp2[i] = dp2[i-1] + cost_ccw;
        if (i >= K)
            dp2[i] = min(dp2[i], dp2[i-K] + cost_ccw);
    }

    long long ans = INF;
    for (int i = 0; i <= N; i++) {
        ans = min(ans, dp1[i] + dp2[N - i]);
    }
    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