Submission #1208068

#TimeUsernameProblemLanguageResultExecution timeMemory
1208068banganDistributing Candies (IOI21_candies)C++20
0 / 100
61 ms7236 KiB
#include "candies.h" #include <vector> std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l_in, std::vector<int> r_in, std::vector<int> v_in) { int n = c.size(); int q = l_in.size(); std::vector<int> cur(n + 1); for (int i = 0; i < q; i++) { int l = l_in[i]; int r = r_in[i]; int x = v_in[i]; cur[l] += x; cur[r + 1] -= x; } for (int i = 1; i < n; i++) { cur[i] += cur[i - 1]; } for (int i = 0; i < n; i++) { if (cur[i] > c[i]) { cur[i] = c[i]; } } cur.resize(n); return cur; }
#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...