Submission #924856

#TimeUsernameProblemLanguageResultExecution timeMemory
924856Programmer123Distributing Candies (IOI21_candies)C++17
3 / 100
5097 ms13288 KiB
#include "candies.h" #include <bits/stdc++.h> 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(); std::vector<int> s(N); int Q = l.size(); for (int i = 0; i < N; ++i) { int val = 0; for (int j = 0; j < Q; ++j) { if (l[j] > i || r[j] < i) continue; val += v[j]; if (val < 0) val = 0; if (val > c[i]) val = c[i]; } s[i] = val; } 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...