Submission #992407

#	Time	Username	Problem	Language	Result	Execution time	Memory
992407		phoenix	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	0 ms	448 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 res = 0;
    int l = 0;
    while (l < n && p[l] * 2 < L) {
        int nxt = min(n - 1, l + k - 1);
        res += min(p[nxt] * 2, L);
        l = nxt + 1;
    }
    int r = n - 1;
    while (r >= l) {
        int nxt = max(r - k + 1, l);
        res += (L - p[nxt]) * 2;
        r = nxt - 1;
    }
    return res;
}

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