#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
vector<ll> calculate_costs(vector<int> W, vector<int> a, vector<int> b, vector<int> e) {
ll n = a.size();
ll q = e.size();
vector<ll> ans(q);
vector<ll> w(n);
ll sum = 0;
for (ll i = 0; i < n; ++i) {
w[i] = (ll)W[i];
sum += b[i];
}
sort(w.begin(), w.end());
for (ll x = 0; x < q; ++x) {
ll d = e[x];
ll i = 0;
ll k = 0;
while (i < n) {
if (i + 1 < n && w[i + 1] - w[i] <= d) {
i += 2;
} else {
++k;
i += 1;
}
}
ans[x] = sum + 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |