Submission #834669

#TimeUsernameProblemLanguageResultExecution timeMemory
834669Mohmad_ZaidDistributing Candies (IOI21_candies)C++17
0 / 100
5059 ms7272 KiB
#include "candies.h" #include <bits/stdc++.h> #define ll long long using namespace std; vector<int> distribute_candies(vector<int> c, vector<int> l,vector<int> r, vector<int> v) { int n = c.size(); int q=l.size(); vector<int> s(n,0); for(int i=0;i<q;i++){ for(int j=l[i];j<=r[i];j++){ if(v[i]>0){ s[i]=min(c[i],s[i]+v[i]); }else{ s[i]=max(0,s[i]-v[i]); } } } 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...