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 <vector>
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l,
vector<int> r, vector<int> v) {
int q = l.size();
int n = c.size();
vector<int> adder (n,0);
vector<int> box(n,0);
for (int i = 0; i < q; i++)
{
adder[l[q]] += v[q];
if (r[q]+1 < n) adder[r[q]+1] -= v[q];
}
int add = 0;
for (int i = 0; i < n; i++)
{
add += adder[i];
if (add < 0)
{
box[i] = max(0, box[i] + add);
}
else {
box[i] = min(c[i], box[i] + add);
}
}
return box;
}
# | 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... |