Submission #1051200

#	Time	Username	Problem	Language	Result	Execution time	Memory
1051200		ArthuroWich	Boxes with souvenirs (IOI15_boxes)	C++17	0 / 100	1 ms	348 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
#define int long long int
using namespace std;
int delivery(int32_t N, int32_t K, int32_t L, int32_t P[]) {
    int ans = INT_MAX, n = N, k = K, l = L;
    vector<int> p;
    for (int i = 0; i < n; i++) {
        p.push_back(P[i]);
    }
    sort(p.begin(), p.end());
    vector<int> dpl(n, 0), dpr(n, 0);
    for (int i = 0; i < n; i++) {
        dpl[i] = 2*p[i];
        if (i-k >= 0) {
            dpl[i] += dpl[i-k];
        }
    }
    for (int i = n-1; i >= 0; i--) {
        dpr[i] = 2*(l-p[i]);
        if (i+k < n) {
            dpr[i] += dpr[i+k];
        }
    }
    for (int i = 1; i < n; i++) {
        ans = min(ans, dpl[i-1]+dpr[i]);
    }
    return ans;
}

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