#include "candies.h"
#include<bits/stdc++.h>
using namespace std;
constexpr int sz = 2e5 + 5;
int n, Q;
vector<int> a;
long long st[sz<<2], lazy[sz<<2];
inline void relax(int l, int r, int in){
if(l ^ r){
lazy[in<<1] += lazy[in], lazy[in<<1|1] += lazy[in];
}
st[in] += (r - l + 1) * lazy[in];
lazy[in] = 0;
return;
}
inline void update(int l, int r, int in, int L, int R, int val){
if(lazy[in]) relax(l, r, in);
if(l > R || r < L || r < l) return;
if(l >= L && r <= R){
lazy[in] = val;
relax(l, r, in);
return;
}else{
int mid = l + ((r - l) >> 1);
update(l, mid, in << 1, L, R, val);
update(mid + 1, r, in << 1 | 1, L, R, val);
st[in] = st[in << 1] + st[in << 1 | 1];
}
return;
}
long long get_ans(int l, int r, int in, int L, int R){
if(lazy[in]) relax(l, r, in);
if(l > R || r < L || r < l) return 0ll;
if(l >= L && r <= R) return st[in];
int mid = l + ((r - l) >> 1);
return get_ans(l, mid, in << 1, L, R) + get_ans(mid + 1, r, in << 1 | 1, L, R);
}
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v){
n = (int)c.size(), Q = (int)r.size();
a.assign(n, 0);
for(register int q = 0; q < Q; ++q){
update(1, n, 1, l[q] + 1, r[q] + 1, v[q]);
}
for(register int i = 1; i <= n; ++i){
a[i-1] = min((long long)c[i-1], get_ans(1, n, 1, i, i));
}
return a;
}
