#include "candies.h" #include <bits/stdc++.h> using namespace std; vector<int> ans; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { int n=c.size(), q=v.size(); for (int i=0; i<n; i++) ans.push_back(0); for (int i=0; i<q; i++) { ans[l[i]]+=v[i]; if (r[i]<=n-2) ans[r[i]+1]-=v[i]; } for (int i=1; i<n; i++) ans[i]+=ans[i-1]; for (int i=0; i<n; i++) ans[i]=min(c[i], ans[i]); return ans; }