Submission #570948

#TimeUsernameProblemLanguageResultExecution timeMemory
570948VanillaDistributing Candies (IOI21_candies)C++17
8 / 100
99 ms11432 KiB
#include <bits/stdc++.h> using namespace std; #define int64 long long const int maxn = 2e5 + 3; const int64 mod = 1e9 + 7; 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> cd (n); for (int i = 0; i < q; i++){ cd[l[i]]+=v[i]; if (r[i] + 1 < n) cd[r[i] + 1]-=v[i]; } int64 sf = 0; for (int i = 0; i < n; i++){ sf+=cd[i]; int64 k = min(sf, (int64) c[i]); cd[i] = k; } return cd; } // int main() { // vector <int> p1 = {10, 15, 20}; // vector <int> p2 = {0, 2}; // vector <int> p3 = {2, 2}; // vector <int> p4 = {4, 9}; // for (int i: distribute_candies(p1, p2, p3, p4)) { // cout << i << " "; // } // }
#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...