#include "candies.h"
#include <vector>
using namespace std;
typedef long long ll;
vector<int> distribute_candies(vector<int> cInt, vector<int> lInt, vector<int> rInt, vector<int> vInt) {
int n = cInt.size();
int q = vInt.size();
vector<ll> s(n+1), c(n), l(q), r(q), v(q);
for(int i = 0; i < n; i++) {
c[i] = cInt[i];
}
for(int i = 0; i < q; i++) {
l[i] = lInt[i];
r[i] = rInt[i];
v[i] = vInt[i];
}
bool subtask2 = true, subtask3 = true, subtask4 = true;
for(int i = 1; i < n; i++) {
if(c[i] != c[i-1]) subtask3 = false;
}
for(int i = 0; i < q; i++) {
if(v[i] < 0) subtask2 = false;
if(r[i] - l[i] != n-1) subtask4 = false;
}
if(n <= 2000 && q <= 2000) { // Subtask 1
for(int i = 0; i < q; i++) {
for(int j = l[i]; j <= r[i]; j++) {
s[j] += v[i];
s[j] = max(s[j], 0LL);
s[j] = min(s[j], c[j]);
}
}
}
else if(subtask2) {
for(int i = 0; i < q; i++) {
s[l[i]] += v[i];
s[r[i]+1] -= v[i];
}
for(int i = 1; i < n; i++) {
s[i] += s[i-1];
}
for(int i = 0; i < n; i++) {
s[i] = min(s[i], c[i]);
}
}
else if(subtask3) {
}
else if(subtask4) {
}
else {
}
vector<int> sInt(n);
for(int i = 0; i < n; i++) sInt[i] = s[i];
return sInt;
}
