#include "candies.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v)
{
    int n = c.size();
    vector<int> a(n + 1);
    for (int i = 0; i < l.size(); i++)
    {
        if (v[i] > 0)
        {
            v[i] = min(c.front(), v[i]);
            a[l[i]] += v[i];
            a[l[i]] = min(c.front(), a[l[i]]);
            if (r[i] + 1 < n)
            {
                a[r[i] + 1] += -v[i];
                a[r[i] + 1] = max(-c.front(), a[r[i] + 1]);
            }
        }
        else
        {
            v[i] = max(-c.front(), v[i]);
            a[l[i]] += v[i];
            a[l[i]] = max(-c.front(), a[l[i]]);
            if(r[i] + 1 < n)
            {
                a[r[i] + 1] += -v[i];
                a[r[i] + 1] = min(c.front(), a[r[i] + 1]);
            }
        }
    }

    for (int i = 1; i < n; i++)
    {
        a[i] += a[i - 1];
    }

    vector<int> res(n);
    for (int i = 0; i < n; i++)
    {
        res[i] = min(c[i], a[i]);
        if (a[i] < 0)
        {
            res[i] = 0;
        }
    }

    return res;
}