Submission #829546

#TimeUsernameProblemLanguageResultExecution timeMemory
829546Abrar_Al_SamitDistributing Candies (IOI21_candies)C++17
8 / 100
80 ms12912 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(); int q = l.size(); vector<long long>s(n); for(int i=0; i<q; ++i) { s[l[i]] += v[i]; if(r[i] < n-1) s[r[i] + 1] -= v[i]; } for(int i=1; i<n; ++i) s[i] += s[i-1]; for(int i=0; i<n; ++i) { s[i] = min(s[i], (long long)c[i]); } vector<int>cs(n); for(int i=0; i<n; ++i) cs[i] = s[i]; return cs; }
#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...