# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64890 | 2018-08-06T04:45:05 Z | daniel_02 | Boxes with souvenirs (IOI15_boxes) | C++17 | 0 ms | 0 KB |
#include "boxes.h" #include <bits/stdc++.h> long long delivery(int N, int K, int L, int p[]) { long long ans = 0; if (K == 1) { for (int i = 0; i < N; i++) { if (p[i] <= L / 2) { ans += (p[i] * 2LL); } else { ans += ((L - p[i]) * 2LL); } } } else if (K == N) { for (int i = 0; i < n; i++) { ans += a[i]; } } else { assert(0); } return ans; }