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 "boxes.h"
#include "bits/stdc++.h"
using namespace std;
#define ll long long
int f(int n, int k){
return (n+k-1) / k;
}
long long delivery(int n, int k, int l, int p[]) {
ll answer = f(n, k) * 1LL * l;
vector<int> arr(n+2);
for (int i = 1; i <= n; i++)
arr[i] = p[i-1];
vector<ll> pref(n+2), suf(n+2);
for (int i = 1; i <= n; i++){
pref[i] = arr[i];
if (i >= k)
pref[i] += pref[i-k];
}
for (int i = n; i >= 1; i--){
suf[i] = l - arr[i];
if (i + k <= n)
suf[i] += suf[i+k];
}
for (int i = 0; i <= n; i++){
answer = min(answer, 2*(pref[i] + suf[i+1]));
if (i+k <= n)
answer = min(answer, l + 2*(pref[i] + suf[i+k]));
}
return answer;
}
# | 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... |