This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define LL long long
const LL INF = 1LL << 60;
LL delivery(int N, int K, int L, int pos[]) {
vector<LL> f(N + 1, INF);
f[0] = 0;
for(int i = 0; i < N; ++i) {
for(int j = i; j < i + K && j < N; ++j) {
LL cost = min(pos[j] + min(pos[j], L - pos[j]), L - pos[i] + min(pos[i], L - pos[i]));
f[j + 1] = min(f[j + 1], f[i] + cost);
}
}
return f[N];
}
#ifdef tomoshibi
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, k, l, pos[100];
cin >> n >> k >> l;
for(int i = 0; i < n; ++i) {
cin >> pos[i];
}
cout << delivery(n, k, l, pos);
return 0;
}
#endif
# | 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... |