Submission #448541

#TimeUsernameProblemLanguageResultExecution timeMemory
448541grtDistributing Candies (IOI21_candies)C++17
3 / 100
5080 ms13260 KiB
#include <bits/stdc++.h> #define ST first #define ND second #define PB push_back using namespace std; using ll = long long; using pi = pair<int,int>; using vi = vector<int>; const int nax = 200 * 1000 + 10; int n, q; vi distribute_candies(vi c, vi la, vi ra, vi v) { n = (int)c.size(); q = (int)la.size(); vi ans(n); for(int i = 0; i < n; ++i) ans[i] = 0; for(int i = 0; i < q; ++i) { for(int j = la[i]; j <= ra[i]; ++j) { ans[j] += v[i]; ans[j] = max(ans[j], 0); ans[j] = min(ans[j], c[j]); } } return ans; } //int main() { //ios_base::sync_with_stdio(0); //cin.tie(0); //int N, Q; //cin >> N >> Q; //vi c(N), l(Q), r(Q), v(Q); //for(int i = 0; i < N; ++i) { //cin >> c[i]; //} //for(int i = 0; i < Q; ++i) { //cin >> l[i] >> r[i] >> v[i]; //} //auto ans = distribute_candies(c,l,r,v); //for(int x : ans) cout << x << " "; //}
#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...