Submission #435751

#TimeUsernameProblemLanguageResultExecution timeMemory
435751tutisDistributing Candies (IOI21_candies)C++17
3 / 100
5073 ms7260 KiB
#include "candies.h" #include <bits/stdc++.h> using namespace std; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { int n = c.size(); vector<int> s(n, 0); int q = l.size(); for (int i = 0; i < q; i++) { if (v[i] > 0) { for (int j = l[i]; j <= r[i]; j++) { s[j] = min(s[j] + v[i], c[j]); } } else { for (int j = l[i]; j <= r[i]; j++) { s[j] = max(s[j] + v[i], 0); } } } 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...