Submission #472925

#TimeUsernameProblemLanguageResultExecution timeMemory
472925oliversommerDistributing Candies (IOI21_candies)C++17
0 / 100
120 ms12184 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) { int left = l[j]; int right = r[j]; s[left] += v[j]; if(right < n - 1) { s[right + 1] -= v[j]; } } for(int i = 1; i < n; ++i) { s[i] += s[i - 1]; s[i - 1] = min(s[i - 1], c[i - 1]); } s[n - 1] = min(s[n - 1], c[n - 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...