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;
const int MAXN = 2e5;
int A[MAXN];
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int q = l.size(), n = c.size();
for (int i = 0; i < q; i++) {
if (v[i] >= 0) {
for (int j = l[i]; j <= r[i]; j++) {
A[j] = (A[j] + v[i] >= c[j] ? c[j] : A[j] + v[i]);
}
} else {
for (int j = l[i]; j <= r[i]; j++) {
A[j] = (A[j] + v[i] >= 0 ? A[j] + v[i] : 0);
}
}
}
vector<int> ans;
for (int i = 0; i < n; i++) ans.push_back(A[i]);
return ans;
}
# | 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... |