#include "candies.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
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> s(n);
    for (int i=0;i<n;i++) {
        s[i] = 0;
    }
    
    for (int i=0;i<n;i++) {
        if (v[i] > 0) {
            for (int j=l[i];j<=r[i];j++) {
                s[j] = min(c[j], s[j] + v[i]);
            }
        } else {
            for (int j=l[i];j<=r[i];j++) {
                s[j] = max(0, s[j] - v[i]);
            }
        }
    }
    return s;
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |