Submission #530228

#TimeUsernameProblemLanguageResultExecution timeMemory
530228Icebear16Distributing Candies (IOI21_candies)C++17
0 / 100
5047 ms7260 KiB
#include "candies.h" #include <bits/stdc++.h> 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,0); for(int j=0;j<q;j++){ for(int i=l[j];i<=r[j];i++){ if(v[j]>=0){ if(c[i]>(s[i]+v[j])) s[i]=c[i]; else s[i]+=v[j]; }else{ if((s[i]+v[j])<0) s[i]=0; else s[i]+=v[j]; } } } 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...