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<lli> parcial(n + 1);
	for (int qq = 0; qq < q; ++qq) {
		parcial[ls[qq]] += xs[qq];
		parcial[rs[qq] + 1] -= xs[qq];
	}
	for (int i = 1; i < n; ++i)
		parcial[i] += parcial[i-1];
	vector<int> ans(n);
	for (int i = 0; i < n; ++i)
		ans[i] = min(parcial[i], 1LL*cs[i]);
	return ans;
}
| # | 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... |