Submission #438756

#TimeUsernameProblemLanguageResultExecution timeMemory
438756MohamedFaresNebiliDistributing Candies (IOI21_candies)C++17
3 / 100
5078 ms13264 KiB
#include <bits/stdc++.h> #include "candies.h" using namespace std; 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 = v.size(); std::vector<int> s(n); for(int i=0;i<n;i++) s[i]=0; for(int i=0;i<q;i++) { int lo=l[i], hi=r[i]; for(int k=lo;k<=hi;k++) { if(v[i]>0) { s[k]=min(v[i]+s[k], c[k]); } else { s[k]=max(v[i]+s[k], 0); } } } 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...