#include "candies.h"
#include<bits/stdc++.h>
using namespace std;
const int nmax=2e5+42;
vector< pair<int,int> > updates[nmax];
int given[nmax];
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
std::vector<int> r, std::vector<int> v) {
int n=c.size();
int q=l.size();
for(int j=0;j<q;j++)
{
updates[l[j]].push_back({j,v[j]});
updates[r[j]+1].push_back({j,0});
}
vector<int> outp={};
for(int i=0;i<n;i++)
{
for(auto w:updates[i])
given[w.first]=w.second;
int cur=0;
for(int j=0;j<q;j++)
{
cur+=given[j];
if(cur<0)cur=0;
else if(cur>c[i])cur=c[i];
}
outp.push_back(cur);
}
return outp;
}
/*
int main() {
int n;
assert(1 == scanf("%d", &n));
std::vector<int> c(n);
for(int i = 0; i < n; ++i) {
assert(scanf("%d", &c[i]) == 1);
}
int q;
assert(1 == scanf("%d", &q));
std::vector<int> l(q), r(q), v(q);
for(int i = 0; i < q; ++i) {
assert(scanf("%d %d %d", &l[i], &r[i], &v[i]) == 3);
}
std::vector<int> ans = distribute_candies(c, l, r, v);
for(int i = 0; i < n; ++i) {
if (i > 0) {
printf(" ");
}
printf("%d", ans[i]);
}
printf("\n");
fclose(stdout);
return 0;
}
*/
