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<bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l,
vector<int> r, vector<int> v) {
int n = c.size();
int q = l.size();
vector<int> diff(n,0);
for(int i = 0 ;i < q ; i++){
diff[l[i]]+=v[i];
if(r[i]+1<n) diff[r[i]+1]-=v[i];
}
for(int i = 1 ;i < n ; i++) diff[i]+=diff[i-1];
for(int i = 0 ; i < n ; i++) diff[i]=min(diff[i],c[i]);
return diff;
}
# | 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... |