Submission #553805

#TimeUsernameProblemLanguageResultExecution timeMemory
553805drdilyorDistributing Candies (IOI21_candies)C++17
3 / 100
5028 ms13276 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(); int allInc = 1; for (int i = 0; i < m; i++) { if (v[i] < 0) allInc = 0; } std::vector<int> s(n); if (allInc) { 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]); } } else { for (int i = 0; i < m; 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...