#include <bits/stdc++.h>
#include "candies.h"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 2e5 + 2;
const int mod = 1e9 + 7;
ll sum[4 * N], mn[4 * N], mx[4 * N];
void Add(int node, int l, int r, int x, int y) {
if (l == r) {
sum[node] += y; mn[node] = mx[node] = sum[node];
return;
}
int mid = l + r >> 1;
if (x <= mid) Add(2 * node, l, mid, x, y);
else Add(2 * node + 1, mid + 1, r, x, y);
sum[node] = sum[2 * node] + sum[2 * node + 1];
mn[node] = min(mn[2 * node], sum[2 * node] + mn[2 * node + 1]);
mx[node] = max(mx[2 * node], sum[2 * node] + mx[2 * node + 1]);
}
int Solve(int node, int l, int r, int x) {
if (l == r) return max(0ll, min((ll)x, sum[node]));
int mid = l + r >> 1;
if (mx[2 * node + 1] - mn[2 * node + 1] > x) return Solve(2 * node + 1, mid + 1, r, x);
int o = Solve(2 * node, l, mid, x);
if (o + mn[2 * node + 1] < 0) return sum[2 * node + 1] - mn[2 * node + 1];
if (o + mx[2 * node + 1] > x) return x + sum[2 * node + 1] - mx[2 * node + 1];
return o + sum[2 * node + 1];
}
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int n = c.size(); int q = v.size();
vector<vector<pair<int, int>>> g(n);
for (int i = 0; i < q; i++) {
g[l[i]].push_back({i, v[i]});
if (r[i] < n - 1) g[r[i] + 1].push_back({i, -v[i]});
}
vector<int> ans;
for (int i = 0; i < n; i++) {
for (auto u : g[i]) Add(1, 0, q - 1, u.first, u.second);
ans.push_back(Solve(1, 0, q - 1, c[i]));
}
return ans;
}
