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