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 <iostream>
#define ll long long
using namespace std;
long long delivery(int n, int k, int L, int p[]) {
int darch = n;
ll ans = 0;
for (int i = 0; i < n; i++){
int m = min(darch,k);
int l = p[i],r = p[i + m - 1];
ll a = 0,b = 0;
a = min((L - l)*2,L);
b = min(r*2,L);
ans += min(a,b);
darch -= m;
i = i + m - 1;
}
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... |