#include <bits/stdc++.h>
#include "candies.h"
#include <vector>
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
std::vector<int> r, std::vector<int> v) {
int n = c.size();
std::vector<int> s(n, 0);
for(int i = 0; i < l.size(); i++) {
for(int j = l[i]; j <= r[i]; j++) {
if(v[i] > 0) {
s[j] = std::min(c[j], s[j] + v[i]);
}
else {
s[j] = std::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... |