Submission #435506

#TimeUsernameProblemLanguageResultExecution timeMemory
435506grtDistributing Candies (IOI21_candies)C++17
3 / 100
5050 ms7344 KiB
#include <bits/stdc++.h> #define ST first #define ND second #define PB push_back using namespace std; using ll = long long; using pi = pair<int,int>; using vi = vector<int>; int n, q; vi distribute_candies(vi c, vi l, vi r, vi v) { n = (int)c.size(); q = (int)l.size(); vi ans(n); for(int i = 0; i < q; ++i) { for(int a = l[i]; a <= r[i]; a++) { ans[a] += v[i]; ans[a] = max(ans[a], 0); ans[a] = min(ans[a], c[a]); } } return ans; } //int main() { //ios_base::sync_with_stdio(0); //cin.tie(0); //vi w = distribute_candies({10, 15, 13}, {0, 0}, {2, 1}, {20, -11}); //for(int x : w) { //cout << x << " "; //} //}
#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...