#include "candies.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<ll, ll>
using namespace std;
const int MAX = 2e5 + 5;
ll tree[MAX * 4];
ll lazy[MAX * 4];
void update(int node, int l, int r, int ql, int qr, int val){
if(ql > r || qr < l) return;
if(ql <= l && r <= qr){
tree[node] += val;
return;
}
int mid = (l + r) / 2;
update(node * 2, l, mid, ql, qr, val);
update(node * 2 + 1, mid + 1, r, ql, qr, val);
}
ll get(int node, int l, int r, int pos){
if(l == r){
return tree[node];
}
tree[node * 2] += tree[node];
tree[node * 2 + 1] += tree[node];
tree[node] = 0;
int mid = (l + r) / 2;
if(pos <= mid){
return get(node * 2, l, mid, pos);
}
else{
return get(node * 2 + 1, mid + 1, r, pos);
}
}
std::vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
for (int i = 0; i < l.size(); i++)
{
update(1, 0, MAX, l[i], r[i], v[i]);
}
vector<int> ans(c.size());
for (int i = 0; i < c.size(); i++)
{
ans[i] = min(c[i] * 1ll, get(1, 0, MAX, i));
}
return ans;
}
