# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624391 | 2022-08-08T06:13:31 Z | John3_141592 | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KB |
#include "candies.h" #include <bits/stdc++.h> #define int long long 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(),q=l.size(); vector <int> vec; for(int i=0;i<=n;i++) vec.push_back(0); for(int i=0;i<q;i++) vec[l[i]]+=v[i],vec[r[i]+1]-=v[i]; vector <int> solve; solve.push_back(vec[0]); for(int i=1;i<n;i++) solve.push_back(vec[i]+solve[i-1]); for(int i=0;i<n;i++) solve[i]=min(solve[i],c[i]); return solve; }