#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue
template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using ti = tuple<int, int, int>;
using Adj = V<vi>;
using vvi = V<vi>;
#include "nile.h"
const ll INF = 1e15;
struct DSU {
int N;
vi sz, par;
int ans = 0;
DSU(int n): N(n) {
sz.assign(n, 1);
par.resize(n);
iota(all(par), 0);
}
int find(int x) { return x == par[x] ? x : find(par[x]); }
bool unite(int u, int v) {
u = find(u), v = find(v);
if (u == v) return 0;
if (sz[u] < sz[v]) swap(u, v);
ans -= sz[u] - (sz[u] & 1);
ans -= sz[v] - (sz[v] & 1);
sz[u] += sz[v];
par[v] = u;
ans += sz[u] - (sz[u] & 1);
return 1;
}
};
vl calculate_costs(vi W, vi A, vi B, vi E) {
int n = W.size();
V<ti> itm(n);
f0r(i, n) {
itm[i] = {W[i], A[i], B[i]};
}
sort(all(itm));
int Q = E.size();
V<pi> Ee(Q);
f0r(i, Q) Ee[i] = {E[i], i};
sort(all(Ee));
vl R(Q, 0);
int ans = 2*n;
DSU dsu(n);
V<ti> ed;
fnr(i, 1, n) {
ed.pb({get<0>(itm[i]) - get<0>(itm[i-1]), i, i-1 });
if (i > 1) ed.pb({get<0>(itm[i]) - get<0>(itm[i-2]), i, i-2 });
}
sort(all(ed));
int l = 0;
for (auto &[d, t]: Ee) {
for (; l < ed.size() && get<0>(ed[l]) <= d; ++l) {
dsu.unite(get<1>(ed[l]), get<2>(ed[l]));
}
R[t] = 2*n - dsu.ans;
}
return R;
f0r(t, Q) {
ll D = E[t];
vl dp(n, INF);
dp[0] = get<1>(itm[0]);
fnr(i, 1, n) {
auto [w, a, b] = itm[i];
auto [w1, a1, b1] = itm[i-1];
dp[i] = dp[i-1] + a;
if (w - w1 <= D) {
ll prev = (i >= 2) ? dp[i-2] : 0;
dp[i] = min(dp[i], prev + b1 + b);
}
if (i >= 2) {
auto [w2, a2, b2] = itm[i-2];
if (w - w2 <= D) {
ll prev = (i >= 3) ? dp[i-3] : 0;
dp[i] = min(dp[i], prev + b2 + a1 + b);
}
}
}
R[t] = dp[n-1];
}
return R;
}
