# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1194382 | amongus_pvp | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KiB |
#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();
int q = l.size();
vector<int> s(n, 0);
for (int i = 0; i < n; ++i) {
int current = 0;
for (int j = 0; j < q; ++j) {
if (i >= l[j] && i <= r[j]) {
if (v[j] > 0) {
current = min(c[i], current + v[j]);
} else {
current = max(0, current + v[j]);
}
}
}
s[i] = current;
}
return s;
}