Submission #800184

#TimeUsernameProblemLanguageResultExecution timeMemory
800184EllinorDistributing Candies (IOI21_candies)C++17
3 / 100
5057 ms13268 KiB
#include <bits/stdc++.h> using namespace std; #define rep(i,a,b) for (int i = (a); i < (b); i++) typedef long long ll; #define pb push_back typedef pair<int, int> pii; #include "candies.h" // #include <vector> 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(); int Q = l.size(); vector<int> s(N, 0); rep(i,0,Q) { int li = l[i], ri = r[i], vv = v[i]; rep(j,li,ri+1) { if (vv > 0) s[j] = min(c[j], s[j] + vv); else s[j] = max(0, s[j] + vv); } } return s; } // int32_t main() // { // vector<int> ans = distribute_candies({10, 15, 13}, {0, 0}, {2, 1}, {20, -11}); // rep(i,0,ans.size()) // { // cerr << ans[i] << " "; // } // }
#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...