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>
#include "boxes.h"
using namespace std;
using ll = long long;
ll delivery(int n, int k, int l, int p[]) {
auto dist = [&](int from,int to){
if(from <= to) return min(to - from,from + l - to);
return min(from - to,l - from + to);
};
ll ans = 0;
int cur = 0, lft = k;
for(int i = 0; i < n; i++){
if(lft == 0){
ans += dist(cur,0);
lft = k;
cur = 0;
}
ans += dist(cur,p[i]);
lft--;
cur = p[i];
}
return ans + dist(cur,0);
}
# | 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... |