| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 528918 | Alex_tz307 | 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.
int64_t delivery(int n, int k, int l, int a[]) {
int full = n / k, rem = n % k;
int64_t ans = (int64_t)full * l;
if (rem) {
ans += min(a[rem - 1] * 2, (l - a[n - rem]) * 2);
}
return ans;
}