Submission #1059311

#TimeUsernameProblemLanguageResultExecution timeMemory
1059311TrentDistributing Candies (IOI21_candies)C++17
3 / 100
5061 ms30556 KiB
#include "candies.h" #include "bits/stdc++.h" using namespace std; #define forR(i, x) for(int i = 0; i < (x); ++i) #define REP(i, a, b) for(int i = (a); i < (b); ++i) typedef long long ll; typedef vector<int> vi; typedef vector<vi> vvi; 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(), m=l.size(); vi ch(m); vvi addOp(n), remOp(n); forR(i, m) { addOp[l[i]].push_back(i); if(r[i] + 1 < n) remOp[r[i]+1].push_back(i); } vi ret(n); forR(i, n) { for(int j : addOp[i]) ch[j] = v[j]; for(int j : remOp[i]) ch[j] = 0; int cur = 0; forR(j, m) cur = max(0, min(c[i], cur + ch[j])); ret[i] = cur; } return ret; }
#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...