Submission #596106

#TimeUsernameProblemLanguageResultExecution timeMemory
596106SuhaibSawalha1Distributing Candies (IOI21_candies)C++17
8 / 100
97 ms12884 KiB
#include "candies.h" #include <bits/stdc++.h> #include <vector> 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> a(n); vector<long long> b(n + 1); for (int qs = 0; qs < q; ++qs) { b[r[qs] + 1] -= v[qs]; b[l[qs]] += v[qs]; } long long s = 0; for (int i = 0; i < n; ++i) { s += b[i]; a[i] = min(c[i] * 1LL, s); } 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...