제출 #441819

#제출 시각아이디문제언어결과실행 시간메모리
441819alan8585사탕 분배 (IOI21_candies)C++17
3 / 100
5046 ms8384 KiB
#include "candies.h" #include <vector> 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(), q = l.size(); std::vector<int> s(n); for(int i = 0; i < q; i++) { for(int j = l[i]; j <= r[i]; j++) { if(v[i] > 0) s[j] = min(c[j], s[j] + v[i]); else s[j] = max(0, 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...