| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 61723 | nvmdava | 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 "boxes.h"
long long delivery(int N, int K, int L, int p[]) {
long long ans = (long long)(N + K - 1) / K * L
int i;
while(p[i] == 0)i++;
i += K - 1;
while(i < n && p[i] * 2 < L){
ans = ans - L + p[i] * 2
i+=k;
}
i = n - k;
while(i >= 0 && (L -p[i]) * 2 < L){
ans = ans - L + (L - p[i]) * 2;
}
return ans;
}
