#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<long long> prefix(n + 1, 0); // difference array
for (int i = 0; i < q; ++i) {
prefix[l[i]] += v[i];
if (r[i] + 1 < n)
prefix[r[i] + 1] -= v[i];
}
vector<int> result(n);
long long curr = 0;
for (int i = 0; i < n; ++i) {
curr += prefix[i];
result[i] = (int)min((long long)c[i], max(0LL, curr)); // fix: matching types
}
return result;
}
# | 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... |