Submission #830883

#TimeUsernameProblemLanguageResultExecution timeMemory
830883JohannDistributing Candies (IOI21_candies)C++17
3 / 100
5061 ms13272 KiB
#include "candies.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; #define sz(x) (int)(x).size() int N, Q; std::vector<int> distribute_candies(vi c, vi l, vi r, vi v) { N = sz(c); Q = sz(l); vi S(N, 0); for (int q = 0; q < Q; ++q) { for (int i = l[q]; i <= r[q]; ++i) { S[i] += v[q]; S[i] = max(S[i], 0); S[i] = min(S[i], 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...