#include "candies.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
std::vector<int32_t> distribute_candies(std::vector<int32_t> c, std::vector<int32_t> l,
                                    std::vector<int32_t> r, std::vector<int32_t> v) {
    int n = c.size(),q = r.size();
    vi a(n,0);
    for (int i = 0;i<q;i++) {
        for (int j = l[i];j<=r[i];j++) {
            a[j]+=v[i];
            a[j] = min(a[j],c[j]);
            a[j] = max(a[j],0);
        }
    }
    return a;
}
| # | 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... |