Submission #443360

#TimeUsernameProblemLanguageResultExecution timeMemory
443360urd05Distributing Candies (IOI21_candies)C++17
8 / 100
139 ms8880 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(); vector<int> s(n); int q=v.size(); vector<long long> delta(n+1); for(int i=0;i<=n;i++) { delta[i]=0; } for(int i=0;i<q;i++) { delta[l[i]]+=v[i]; delta[r[i]+1]-=v[i]; } long long val=0; for(int i=0;i<n;i++) { val+=delta[i]; s[i]=min((long long)c[i],val); } return s; }
#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...