| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 746901 | vjudge1 | Calvinball championship (CEOI15_teams) | 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>
using namespace std;
long long delivery(int N, int K, int L, vector<int> positions) {
long long ans = 0;
for (int i = N - 1; i >= 0; i -= K) {
if (positions[max(0, i - K + 1)] > L / 2)
ans += 2 * (L - positions[i - K + 1]);
else if (positions[i] > L / 2)
ans += L;
else
ans += 2 * positions[i];
cerr << positions[i] << ", " << ans << endl;
}
return ans;
}