#include "candies.h"
#include <limits.h>
#include <algorithm>
#include <vector>
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int n = c.size();
int q = l.size();
vector<int> s(n);
vector<long long> lls(n);
// queries
for (int j = 0; j < q; ++j) {
int left = l[j];
int right = r[j];
lls[left] += v[j];
if (right < n - 1) {
lls[right] -= v[j];
}
}
// prefix sum
for (int i = 1; i < n; ++i) {
lls[i] += lls[i - 1];
}
// capacity
for (int i = 0; i < n; ++i) {
s[i] = min(max(lls[i], 0ll), (long long) c[i]);
}
return s;
}
