Submission #720995

#	Time	Username	Problem	Language	Result	Execution time	Memory
720995		joelgun14	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	557 ms	293788 KiB

boxes

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

long long delivery(int N, int K, int L, int p[]) {
    long long pref[N + 1], suff[N + 2];
    memset(pref, 0, sizeof(pref));
    memset(suff, 0, sizeof(suff));
    // coba ke next atau ke 0
    for(int i = 1; i <= N; ++i) {
        if(i - K < 0) {
            pref[i] = p[i - 1] + min(p[i - 1], L - p[i - 1]);
        }
        else {
            pref[i] = pref[i - K] + p[i - 1] + min(p[i - 1], L - p[i - 1]);
        }
    }
    for(int i = N; i >= 1; --i) {
        if(i + K > N)
            suff[i] = L - p[i - 1] + min(p[i - 1], L - p[i - 1]);
        else
            suff[i] = L - p[i - 1] + suff[i + K] + min(p[i - 1], L - p[i - 1]);
    }
    long long mn = 1e18;
    for(int i = 0; i <= N; ++i) {
        //cout << pref[i] << " " << suff[i + 1] << endl;
        mn = min(mn, pref[i] + suff[i + 1]);
    }
    return mn;
}

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