Submission #986991

#TimeUsernameProblemLanguageResultExecution timeMemory
986991pedroslreyDistributing Candies (IOI21_candies)C++17
3 / 100
5040 ms13396 KiB
#include <bits/stdc++.h> #include "candies.h" using namespace std; using lli = long long; vector<int> distribute_candies(vector<int> cs, vector<int> ls, vector<int> rs, vector<int> xs) { int n = cs.size(), q = ls.size(); vector<int> vals(n); for (int qq = 0; qq < q; ++qq) for (int i = ls[qq]; i <= rs[qq]; ++i) vals[i] = max(0, min(cs[i], vals[i] + xs[qq])); return vals; }
#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...