Submission #436556

#TimeUsernameProblemLanguageResultExecution timeMemory
436556StickfishDistributing Candies (IOI21_candies)C++17
3 / 100
604 ms7252 KiB
#include "candies.h" #include <vector> using namespace std; using ll = long long; 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> s(n, 0); for(int i = 0; i < q; ++i) ++r[i]; if(n <= 2000){ for(int qi = 0; qi < q; ++qi){ for(int i = l[qi]; i < r[qi]; ++i){ s[i] += v[qi]; s[i] = max(s[i], 0); s[i] = min(s[i], c[i]); } } } 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...