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