Submission #1051464

#TimeUsernameProblemLanguageResultExecution timeMemory
1051464MarwenElarbiDistributing Candies (IOI21_candies)C++17
0 / 100
5040 ms12112 KiB
#include <bits/stdc++.h> using namespace std; #include "candies.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(); vector<int> ans(n,0); for (int i = 0; i < n; ++i) { for (int j = l[i]; j <= r[i]; ++j) { ans[j]+=v[i]; if(ans[j]>c[j]) ans[j]=c[j]; if(ans[j]<0) ans[j]=0; } } 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...