Submission #798556

#	Time	Username	Problem	Language	Result	Execution time	Memory
798556		HaroldVemeno	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	423 ms	121408 KiB

boxes

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

using namespace std;
using ll = long long;

ll dp[10000000];

long long delivery(int n, int k, int l, int p[]) {
    for(int i = 0; i < min(n, k); ++i) {
        dp[i] = min({2*p[i], 2*(l-p[0]), l});
    }
    for(int i = k; i < n; ++i) {
        dp[i] = dp[i-k] + min({2*p[i], 2*(l-p[i-k+1]), l});
    }
    ll res = dp[n-1];
    for(int i = max(0, n-k-1); i < n-1; ++i) {
        res = min(res, dp[i] + min({2*p[n-1], 2*(l-p[i+1]), l}));
    }
    if(0) {
        for(int i = 0; i < n; ++i) {
            cout << dp[i] << ' ';
        }
        cout << '\n';
    }
    return res;
}

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