Submission #553799

#TimeUsernameProblemLanguageResultExecution timeMemory
553799drdilyorDistributing Candies (IOI21_candies)C++17
0 / 100
105 ms12980 KiB
#include "candies.h" #include <bits/stdc++.h> #define vi vector<int> #define ll long long using namespace std; std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) { int n = c.size(), m = l.size(); std::vector<int> s(n); vi diff(n + 1); for (int i = 0; i < m; i++) { diff[l[i]] += v[i]; diff[r[i]+1] -= v[i]; } for (int i = 0, sum = 0; i < n; i++) { sum += diff[i]; s[i] = max(sum, 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...