제출 #472671

#제출 시각아이디문제언어결과실행 시간메모리
472671oliversommer사탕 분배 (IOI21_candies)C++17
0 / 100
124 ms12168 KiB
#include "candies.h" #include <algorithm> #include <vector> using namespace std; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { int n = c.size(); int q = l.size(); vector<int> s(n); for (int j = 0; j < q; ++j) { s[l[j]] += v[j]; s[r[j]] = max(s[r[j]] - v[j], 0); } for (int i = 1; i < n; ++i) { s[i] = min(s[i] + s[i - 1], 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...