Submission #1217011

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

boxes

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

long long delivery(int N, int K, int L, int pos[]) {
    vector<int> a(pos, pos + N);
    vector<long long> dp1(N + 1, 0), dp2(N + 1, 0);

    for (int i = 1; i <= N; i++) {
        dp1[i] = dp1[i - 1]; 
        if (i >= K)
            dp1[i] = min(dp1[i], dp1[i - K] + 2LL * a[i - 1]);
        else
            dp1[i] = 2LL * a[i - 1];
    }

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

    long long ans = LLONG_MAX;
    for (int i = 0; i <= N; i++) {
        ans = min(ans, dp1[i] + dp2[N - i]);
    }

    return ans;
}

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