Submission #788515

#TimeUsernameProblemLanguageResultExecution timeMemory
788515alexander707070Distributing Candies (IOI21_candies)C++17
0 / 100
80 ms8812 KiB
#include<bits/stdc++.h>
#define MAXN 1000007
using namespace std;
 
int n,q,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];
        curr[i]=min(s,c[i]);
    }

    return curr;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...