Submission #1020698

#TimeUsernameProblemLanguageResultExecution timeMemory
1020698Blistering_BarnaclesDistributing Candies (IOI21_candies)C++17
3 / 100
5083 ms13396 KiB
#include "candies.h" #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 = (int)l.size(); vector<int> a(n); for(int i = 0; i < q; i++){ for(int j = l[i]; j <= r[i]; j++){ a[j] += v[i]; a[j] = max(a[j], 0); a[j] = min(a[j], c[j]); } } 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...