Submission #1290338

#TimeUsernameProblemLanguageResultExecution timeMemory
1290338MMihalevDistributing Candies (IOI21_candies)C++20
3 / 100
5090 ms7340 KiB
#include<iostream> #include<vector> #include<algorithm> #include<set> #include "candies.h" using namespace std; const int MAX_N=2e5+5; vector<long long>p; std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,std::vector<int> r, std::vector<int> v) { vector<int>a; a.resize((int)c.size()); for(int i=0;i<l.size();i++) { for(int j=l[i];j<=r[i];j++) { if(v[i]>0) { a[j]=min(c[j],a[j]+v[i]); } else a[j]=max(0,a[j]+v[i]); } } return a; }
#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...