Submission #1349495

#	Time	Username	Problem	Language	Result	Execution time	Memory
1349495		kantaponz	Boxes with souvenirs (IOI15_boxes)	C++20	100 / 100	379 ms	274388 KiB

boxes

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

#define ll long long

long long delivery(int N, int K, int L, int p[]) {
    vector<ll> a(N + 5, 0);
    vector<ll> cw(N + 5, 0), ccw(N + 5, 0);
    for (int i = 1; i <= N; i++) a[i] = p[i - 1];
    for (int i = 1; i <= N; i++) cw[i] = cw[max(0, i - K)] + 2 * a[i];
    for (int i = N; i >= 1; i--) ccw[i] = ccw[min(N + 1, i + K)] + 2 * (L - a[i]);
    ll ans = 1e18;
    for (int i = 0; i <= N; i++) {
        ans = min(ans, cw[i] + ccw[i + 1]);
        ans = min(ans, cw[i] + L + ccw[i + K + 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