Submission #472683

#TimeUsernameProblemLanguageResultExecution timeMemory
472683oliversommerDistributing Candies (IOI21_candies)C++17
0 / 100
126 ms7236 KiB
#include "candies.h" #include <algorithm> #include <vector> using namespace std; 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); for (int j = 0; j < q; ++j) { s[l[j]] = min(s[l[j]] + v[j], c[j]); s[r[j]] = max(s[r[j]] + v[j], 0); } for(int i = 1; i < n; ++i) { s[i] += s[i - 1]; } 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...