#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define vc vector
#define st first
#define nd second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)a.size()
#define pub push_back
#define pob pop_back
vc<int> distribute_candies(vc<int> _c, vc<int> _l, vc<int> _r, vc<int> _v) {
vc<ll> c(all(_c));
vc<ll> l(all(_l));
vc<ll> r(all(_r));
vc<ll> v(all(_v));
ll n = sz(c), q = sz(l);
vc<ll> o(n + 1);
for (ll i = 0; i < q; i++) {
o[l[i]] += v[i];
o[r[i] + 1] -= v[i];
}
vc<int> ret(n);
ll s = 0;
for (ll i = 0; i < n; i++) {
s += o[i];
ret[i] = (int)min(s, c[i]);
}
return ret;
}
# | 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... |