Submission #1024206

#TimeUsernameProblemLanguageResultExecution timeMemory
1024206AbitoDistributing Candies (IOI21_candies)C++17
0 / 100
64 ms8016 KiB
#include "candies.h" #include <bits/stdc++.h> using namespace std; const int N=2e5+5; int n,q; std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) { n=c.size(); q=l.size(); vector<int> a(n,0),ans(n,0); for (int i=0;i<q;i++){ a[l[i]]+=v[i]; if (r[i]<n-1) a[r[i]+1]-=v[i]; } for (int i=0;i<n;i++){ if (i) a[i]+=a[i-1]; ans[i]=min(a[i],c[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...