Submission #1243011

#TimeUsernameProblemLanguageResultExecution timeMemory
1243011nibertDistributing Candies (IOI21_candies)C++20
3 / 100
5094 ms7240 KiB
#include <vector> #include <algorithm> using namespace std; vector<int> distribute_candies(vector<int> c,vector<int> l,vector<int> r,vector<int> v) { int n = c.size(), q = r.size(); vector<int> boxes(n, 0); for (int i = 0; i < q; i++){ int left = l[i], right = r[i], value = v[i]; if (value > 0){ for (int j = left; j <= right; j++){ boxes[j] = min(c[j], boxes[j] + value); } } else { for (int j = left; j <= right; j++){ boxes[j] = max(0, boxes[j] + value); } } } return boxes; }
#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...