Submission #1242466

#TimeUsernameProblemLanguageResultExecution timeMemory
1242466nibertDistributing Candies (IOI21_candies)C++20
3 / 100
5093 ms7328 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 = l.size(); vector<int> curr(n, 0); for (int j = 0; j < q; ++j) { for (int k = l[j]; k <= r[j]; ++k) { if (v[j] > 0) { int add = min(v[j], c[k] - curr[k]); curr[k] += add; } else { int remove = min(-v[j], curr[k]); curr[k] -= remove; } } } return curr; }
#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...