#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
vector<int> left, right;
for (int i = 0; i < N; i++)
if (p[i] <= L / 2) {
left.push_back(p[i]);
} else
right.push_back(p[i]);
long long ans = 0;
for (int i = K - 1; i < left.size(); i += K) {
ans += 2 * left[i];
}
for (int i = K - 1; i < right.size(); i += K) {
ans += 2 * (L - right[i]);
}
ans += (left.size() % K + right.size() % K + K - 1) / K;
return ans;
}
# | 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... |