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;const int q=2e7;int64_t l[q],r[q];long long delivery(int n,int k,int m,int p[]){for(int i=1;i<=n;i++)l[i]=l[max(0,i-k)]+min(p[i-1]*2,m);reverse(p,p+n);for(int i=1;i<=n;i++)r[i]=r[max(0,i-k)]+min((m-p[i-1])*2,m);int64_t rs=1e18;for(int i=0;i<=n;i++)rs=min(rs,l[i]+r[n-i]);return rs;}
# | 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... |