Submission #624390

#TimeUsernameProblemLanguageResultExecution timeMemory
624390John3_141592Distributing Candies (IOI21_candies)C++17
0 / 100
98 ms8884 KiB
#include "candies.h" #include <bits/stdc++.h> using namespace std; std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,std::vector<int> r, std::vector<int> v) { int n=c.size(),q=l.size(); vector <int> vec; for(int i=0;i<=n;i++) vec.push_back(0); for(int i=0;i<q;i++) vec[l[i]]+=v[i],vec[r[i]+1]-=v[i]; vector <int> solve; solve.push_back(vec[0]); for(int i=1;i<n;i++) solve.push_back(vec[i]+solve[i-1]); for(int i=0;i<n;i++) solve[i]=min(solve[i],c[i]); return solve; }
#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...