Submission #924857

#TimeUsernameProblemLanguageResultExecution timeMemory
924857Programmer123Distributing Candies (IOI21_candies)C++17
0 / 100
79 ms8016 KiB
#include "candies.h" #include <bits/stdc++.h> std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) { int N = c.size(); int Q = l.size(); std::vector<int> ans(N); int diff[N + 1]; for (int i = 0; i < N; ++i) { diff[i] = 0; } for (int i = 0; i < Q; ++i) { diff[l[i]] += v[i]; diff[r[i] + 1] -= v[i]; } for (int i = 1; i < N; ++i) { diff[i] += diff[i - 1]; } for (int i = 0; i < N; ++i) { ans[i] = std::min(diff[i], c[i]); } return ans; }
#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...