Submission #587253

#TimeUsernameProblemLanguageResultExecution timeMemory
587253jakubdDistributing Candies (IOI21_candies)C++17
3 / 100
89 ms16228 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> s; if (n <= 2000 && q <= 2000) { s.resize(n); for (int i = 0; i < q; i++) { for (int j = l[i]; j <= r[i]; j++) { s[j] += v[i]; if (s[j] < 0) s[j] = 0; if (s[j] > c[j]) s[j] = c[j]; } } } else { vector<long long> pref(n + 1); for (int i = 0; i < q; i++) { pref[l[i]] += v[i]; pref[r[i] + 1] -= v[i]; } for (int i = 0; i < n; i++) pref[i + 1] += pref[i]; for (int i = 0; i < n; i++) { s[i] = min(pref[i + 1], (long long) 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...