#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(p[i - 1], l - p[j]));
}
return dp[n] * 2;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |