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;
long long delivery(int N, int K, int L, int p[]) {
    long long ans = 1ll * N * L;
    for (int i = 0; i < N; i++) {
        long long cur = 0;
        int x = i;
        int y = i + 1;
        while (x >= 0) {
            cur += min(L, p[x] * 2);
            x -= K;
        }
        while (y < N) {
            cur += min(L, (L - p[y]) * 2);
            y += K;
        }
        ans = min(ans, cur);
    }
    return ans;
}
| # | 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... |