Submission #490827

#TimeUsernameProblemLanguageResultExecution timeMemory
490827KarukDistributing Candies (IOI21_candies)C++17
0 / 100
78 ms13240 KiB
#include<bits/stdc++.h> using namespace std; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { int n=sizeof(c); int q=sizeof(l); vector<int>ans(n,0); for(int i=0;i<q;i++) { for(int j=l[i];j<=r[i];j++) { if(v[i]>0)ans[j]=min(c[j],ans[j]+v[i]); else ans[j]=max(0,ans[j]+v[i]); } } 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...