Submission #1369367

#TimeUsernameProblemLanguageResultExecution timeMemory
1369367avighnaDistributing Candies (IOI21_candies)C++20
3 / 100
5090 ms7388 KiB
#include <bits/stdc++.h>

using namespace std;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
  const int n = c.size(), q = v.size();
  vector<int> ans(n);
  for (int i = 0; i < q; ++i) {
    for (int j = l[i]; j <= r[i]; ++j) {
        ans[j] += v[i];
        ans[j] = max(ans[j], 0), ans[j] = min(ans[j], c[j]);
    }
  }
  return ans;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...