#include "candies.h"
#include <algorithm>
#include <cstdio>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
const int INF = 1070000000;
const int N = 200005;
int n, a[N], c[N], C, res[N];
long long inc[N];
std::vector<int> distribute_candies(std::vector<int> c_, std::vector<int> l, std::vector<int> r, std::vector<int> v) {
n = (int)c_.size();
std::vector<int> ans(n);
for (int i = 0; i < n; ++i) c[i] = c_[i];
if (n <= 2000 && l.size() <= 2000) {
for (int i = 0; i < (int)l.size(); ++i) {
int ll = l[i], rr = r[i] + 1, d = v[i];
for (int j = ll; j < rr; ++j) a[j] += d;
if (d > 0) {
for (int j = ll; j < rr; ++j) a[j] = a[j] < c[j] ? a[j] : c[j];
} else {
for (int j = ll; j < rr; ++j) a[j] = a[j] < 0 ? 0 : a[j];
}
}
for (int i = 0; i < n; ++i) ans[i] = a[i];
} else {
bool pos = 1;
for (int i = 0; i < (int)v.size(); ++i) if (v[i] < 0) pos = 0;
if (pos) {
for (int i = 0; i < (int)l.size(); ++i) {
inc[l[i]] += v[i];
inc[r[i] + 1] -= v[i];
}
for (int i = 0; i < n; ++i) {
if (i) inc[i] += inc[i - 1];
ans[i] = std::min((long long)c[i], inc[i]);
}
} else {
C = c[0];
for (int i = 0; i < (int)l.size(); ++i) {
int ll = l[i], rr = r[i] + 1, d = v[i];
for (int j = ll; j < rr; ++j) res[j] += d;
if (d < 0) {
for (int j = 0; j < n; ++j) res[j] = res[j] < 0 ? 0 : res[j];
}
else {
for (int j = 0; j < n; ++j) res[j] = C < res[j] ? C : res[j];
}
}
for (int j = 0; j < n; ++j) ans[j] = res[j];
}
}
return ans;
}
