Submission #788513

#TimeUsernameProblemLanguageResultExecution timeMemory
788513alexander707070Distributing Candies (IOI21_candies)C++17
3 / 100
5071 ms13272 KiB
#include<bits/stdc++.h> #define MAXN 1000007 using namespace std; int n,q; 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++){ for(int f=l[i];f<=r[i];f++){ curr[f]+=v[i]; if(curr[f]<0)curr[f]=0; if(curr[f]>c[f])curr[f]=c[f]; } } 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...