Submission #1028635

#TimeUsernameProblemLanguageResultExecution timeMemory
1028635JahonaliXDistributing Candies (IOI21_candies)C++17
3 / 100
59 ms8016 KiB
#include <bits/stdc++.h> using namespace std; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { int n = c.size(), q = v.size(); vector<int> a(n); if (n <= 2000 && q <= 2000) { for (int i = 0; i < q; ++i) for (int j = l[i]; j <= r[i]; ++j) a[j] = max(0, min(c[j], a[j] + v[i])); } else { bool ok = true; for (int i : v) ok &= i > 0; if (ok) { } else { } } return a; }
#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...