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>
#define ll long long
#define INF 1e+18
using namespace std;
ll mi = INF,l[10000010],r[10000010];
ll delivery(int n,int k,int L,int x[]){
l[0] = 0;
r[n] = 0;
for(ll i = 1;i <= n;i++){
if(i < k){
l[i] = x[i - 1] * 2;
r[n - i] = (L - x[n - i]) * 2;
}
else{
l[i] = l[i - k] + x[i - 1] * 2;
r[n - i] = r[n - i + k] + (L - x[n - i]) * 2;
}
}
for(ll i = 0;i <= n;i++) mi = min(mi,l[i] + r[i]);
for(ll i = 0;i + k <= n;i++) mi = min(mi,l[i] + L + r[i + k]);
return mi;
}
# | 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... |