Submission #1050413

#TimeUsernameProblemLanguageResultExecution timeMemory
1050413ZicrusDistributing Candies (IOI21_candies)C++17
8 / 100
69 ms12080 KiB
#include <bits/stdc++.h> #include "candies.h" using namespace std; typedef long long ll; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { ll n = c.size(), q = v.size(); vector<int> res(n); for (int i = 0; i < q; i++) { res[l[i]] += v[i]; if (r[i]+1 < n) res[r[i]+1] -= v[i]; } ll sum = 0; for (int i = 0; i < n; i++) { sum += res[i]; res[i] = clamp(sum, 0ll, (ll)c[i]); } return res; }
#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...