#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
struct segmentTree {
vl t;
segmentTree(int n) {
t = vl(4*n);
}
void update(int v, int tl, int tr, int l, int r, ll add) {
if (l > r)
return;
if (l == tl && r == tr) {
t[v] += add;
} else {
int tm = (tl + tr) / 2;
update(v*2, tl, tm, l, min(r, tm), add);
update(v*2+1, tm+1, tr, max(l, tm+1), r, add);
}
}
ll get(int v, int tl, int tr, int pos) {
if (tl == tr)
return t[v];
int tm = (tl + tr) / 2;
if (pos <= tm)
return t[v] + get(v*2, tl, tm, pos);
else
return t[v] + get(v*2+1, tm+1, tr, pos);
}
};
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();
std::vector<int> s(n);
segmentTree tree(n);
for (int i = 0; i < l.size(); i++) {
tree.update(1, 0, n-1, l[i], r[i], v[i]);
}
for (int i = 0; i < n; i++) {
s[i] = min((ll)c[i], tree.get(1, 0, n-1, i));
}
return s;
}
