Submission #1053207

#TimeUsernameProblemLanguageResultExecution timeMemory
1053207MercubytheFirstDistributing Candies (IOI21_candies)C++17
3 / 100
5096 ms13276 KiB
#include "candies.h" #include <bits/stdc++.h> using namespace std; using ll = long long; std::vector<signed> distribute_candies(std::vector<signed> c, std::vector<signed> l, std::vector<signed> r, std::vector<signed> v) { ll n = c.size(), Q = l.size(); vector<signed> ans(n); for(ll i = 0; i < Q; ++i) { for(ll j = l[i]; j <= r[i]; ++j) { ans[j] += v[i]; ans[j] = max(0, ans[j]); ans[j] = min(c[j], ans[j]); } } 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...