#include "candies.h"
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define vll vector<ll>
#define pll pair<ll, ll>
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();
vll a(n);
for(ll i=0;i<q;i++){
a[l[i]]+=v[i];
if(r[i]<n-1) a[r[i]+1]-=v[i];
}
for(ll i=1;i<n;i++){
a[i]+=a[i-1];
}
for(ll i=0;i<n;i++){
a[i]=min(a[i], (ll) c[i]);
}
vector<int> re(n);
for(ll i=0;i<n;i++){
re[i]=a[i];
}
return re;
}
# | 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... |