# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
421362 | jlallas384 | Boxes with souvenirs (IOI15_boxes) | C++17 | 0 ms | 0 KiB |
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 pi[]) {
ll ans = 0;
vector<int> p(n+2);
for(int i = 1; i <= n; i++){
p[i] = pi[i-1];
}
for(int i = 0; i < n; i++){
ans += min(p[i+1] - p[i],p[i] + l - p[i+1]);
}
return ans + min(p[i],l - p[i]);
}