Submission #1166927

#TimeUsernameProblemLanguageResultExecution timeMemory
1166927PagodePaivaDistributing Candies (IOI21_candies)C++20
8 / 100
66 ms10944 KiB
#include "candies.h" #include<bits/stdc++.h> using namespace std; const int N = 200010; long long pref[N][2]; 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(); for(int i = 0;i < q;i++){ if(v[i] > 0){ pref[l[i]][0] += v[i]; pref[r[i]+1][0] -= v[i]; } else{ pref[l[i]][1] += v[i]; pref[r[i]+1][1] -= v[i]; } } vector <int> s; long long p = 0; for(int i = 0;i < n;i++){ p += pref[i][0]; if(p > c[i]) s.push_back(c[i]); else s.push_back(p); } 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...