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>
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>add(n+1,0);
vector<int>ans(n,0);
for(int i=0;i<q;i++)
{
add[l[i]]+=v[i];
add[r[i]+1]-=v[i];
}
for(int i=0;i<n;i++)
{
if(i!=0)ans[i]=ans[i-1];
ans[i]+=add[i];
}
for(int i=0;i<n;i++)
{
if(ans[i]>c[i])ans[i]=c[i];
}
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... |