# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
796700 | 2023-07-28T15:52:31 Z | Minindu206 | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KB |
#include "candies.h" #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 = c.size(), q = l.size(); vector<int> candies(n, 0); if(n <= 2000 & q <= 2000) { for(int i=0;i<q;i++) { int ll = l[i], rr = r[i]; while(ll >= rr) { candies[ll] += v[i]; if(candies[ll] > c[ll]) candies[ll] = c[ll]; if(candies[ll] < 0) candies[ll] = 0; ll++; } } return candies; } else { int ans = 0; for(int val:v) ans += val; for(int i=0;i<n;i++) candies[i] = min(val, c[i]); return candies; } }