Submission #1201512

#TimeUsernameProblemLanguageResultExecution timeMemory
1201512HappyCapybaraDistributing Candies (IOI21_candies)C++17
0 / 100
47 ms7236 KiB
#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> res(n+1, 0); for (int i=0; i<q; i++){ res[l[i]] += v[i]; res[r[i]+1] -= v[i]; } for (int i=1; i<n; i++) res[i] += res[i-1]; for (int i=0; i<n; i++) res[i] = min(c[i], res[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...