Submission #1213373

#TimeUsernameProblemLanguageResultExecution timeMemory
1213373omsincoconutDistributing Candies (IOI21_candies)C++17
3 / 100
5091 ms7240 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 = l.size(); vector<int> s(n); for (int i = 0; i < q; i++) { for (int j = l[i]; j <= r[i]; j++) { s[j] = max(0, min(c[j], s[j] + v[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...