Submission #1048123

#TimeUsernameProblemLanguageResultExecution timeMemory
1048123vjudge1Distributing Candies (IOI21_candies)C++17
8 / 100
54 ms13396 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(); std::vector<long long> s(n+1); int q=l.size(); for(int i=0;i<q;i++) s[l[i]]+=v[i],s[r[i]+1]-=v[i]; for(int i=1;i<n;i++) s[i]+=s[i-1]; vector<int> s2; for(int i=0;i<n;i++) s2.push_back(min(s[i],c[i]*1ll)); s.pop_back(); return s2; }
#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...