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 <candies.h>
#include <bits/stdc++.h>
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> res(n);
for (int i = 0; i < n; ++i) {
res[i] = 0;
}
for (int i = 0; i < q; ++i) {
if (v[i] > 0) {
for (int j = l[i]; j <= r[i]; ++j) {
res[j] = min(c[j], res[j] + v[i]);
}
}
else {
for (int j = l[i]; j <= r[i]; ++j) {
res[j] = max(0, res[j] + v[i]);
}
}
}
return res;
}
# | 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... |