Submission #541515

#	Time	Username	Problem	Language	Result	Execution time	Memory
541515		Jomnoi	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	593 ms	293800 KiB

boxes

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

const int MAX = 1e7 + 10;
const long long INF = 1e18 + 7;

long long pre[MAX], suf[MAX];

long long delivery(int N, int K, int L, int p[]) {
    for(int i = 1; i <= N; i++) {
        pre[i] = pre[max(0, i - K)] + p[i - 1] + min(p[i - 1], L - p[i - 1]);
    }

    for(int i = N; i >= 1; i--) {
        suf[i] = suf[min(N + 1, i + K)] + (L - p[i - 1]) + min(p[i - 1], L - p[i - 1]);
    }

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