Submission #1227594

#	Time	Username	Problem	Language	Result	Execution time	Memory
1227594		LucaIlie	Boxes with souvenirs (IOI15_boxes)	C++20	50 / 100	2091 ms	6532 KiB

boxes

#include "boxes.h"
#include <stdio.h>
#include <algorithm>

using namespace std;

const int MAX_N = 1e7;
const long long INF = 1e18;
int n, k, l;
long long dp[MAX_N + 1];

int cost(int x) {
    return min(x, l - x);
}

long long delivery(int N, int K, int L, int p[]) {
    n = N;
    k = K;
    l = L;
    sort(p, p + n);
    for (int i = 1; i <= n; i++) {
        dp[i] = INF;
        for (int j = i - 1; j >= 0 && j >= i - k; j--) 
            dp[i] = min(dp[i], dp[j] + min(2 * min(p[i - 1], l - p[j]), l));
    }

    return dp[n];
}

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