#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include "candies.h"
using namespace std;
const int MAX_N=2e5+5;
vector<long long>p;
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,std::vector<int> r, std::vector<int> v)
{
vector<int>a;
a.resize((int)c.size());
p.resize((int)c.size()+1);
for(int i=0;i<l.size();i++)
{
for(int j=l[i];j<=r[i];j++)
{
p[l[i]]+=v[i];
p[r[i]+1]-=v[i];
}
}
long long cur=0;
for(int i=0;i<a.size();i++)
{
cur+=p[i];
a[i]=min(cur,(long long)c[i]);
}
return a;
}
