Submission #436325

#TimeUsernameProblemLanguageResultExecution timeMemory
436325gromperenDistributing Candies (IOI21_candies)C++17
8 / 100
141 ms8900 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(); int q = l.size(); vector<int> s(n); vector<long long> pre(n+1); for (int i = 0; i < q; ++i) { pre[l[i]] += v[i]; pre[r[i]+1] -= v[i]; } for (int i = 0; i < n; ++i) { if (i > 0) pre[i] += pre[i-1]; s[i] = min(pre[i], 1LL * c[i]); } 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...