#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll delivery(int N, int K, int L, int positions[]) {
vector<ll> cw, acw;
for (int i = 0; i < N; i++) {
int pos = positions[i];
if (pos == 0) continue;
if (pos <= L - pos)
cw.push_back(pos);
else
acw.push_back(L - pos);
}
sort(cw.begin(), cw.end(), greater<ll>());
sort(acw.begin(), acw.end(), greater<ll>());
ll cost = 0;
for (int i = 0; i < cw.size(); i += K)
cost += 2LL * cw[i];
for (int i = 0; i < acw.size(); i += K)
cost += 2LL * acw[i];
return cost;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |