Submission #836445

#TimeUsernameProblemLanguageResultExecution timeMemory
836445ma_moutahidDistributing Candies (IOI21_candies)C++17
3 / 100
5072 ms13128 KiB
#include "candies.h" #include <vector> std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) { int n = c.size(); int q=l.size(); std::vector<int> s(n); for(int i=0;i<q;i++){ int x=l[i]; int y=r[i]; for(int j=x;j<=y;j++){ s[j]+=v[i]; if(s[j]>c[j])s[j]=c[j]; if(s[j]<0)s[j]=0; } } return s; }
#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...