#include <vector>
#include <algorithm>
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int n = c.size(), q = l.size();
vector<int> curr(n, 0);
for (int j = 0; j < q; ++j) {
for (int k = l[j]; k <= r[j]; ++k) {
if (v[j] > 0) {
int add = min(v[j], c[k] - curr[k]);
curr[k] += add;
} else {
int remove = min(-v[j], curr[k]);
curr[k] -= remove;
}
}
}
return curr;
}
# | 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... |