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 <vector>
#include <cmath>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
ll n = c.size();
ll q = l.size();
vector<int> ans(n);
vector<ll> change(n + 1);
for (ll i = 0; i < q; i++) {
change[l[i]] += v[i];
change[r[i] +1] -= v[i];
}
ll akt = 0;
for (ll i = 0; i < n; i++) {
akt += change[i];
ans[i] = min((ll) c[i], akt);
}
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... |