This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "candies.h"
using namespace std;
using lli = long long;
vector<int> distribute_candies(vector<int> cs, vector<int> ls, vector<int> rs, vector<int> xs) {
	int n = cs.size(), q = ls.size();
	vector<int> vals(n);
	for (int qq = 0; qq < q; ++qq)
		for (int i = ls[qq]; i <= rs[qq]; ++i) 
			vals[i] = max(0, min(cs[i], vals[i] + xs[qq]));
	return vals;
}
| # | 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... |