제출 #472693

#제출 시각아이디문제언어결과실행 시간메모리
472693oliversommerDistributing Candies (IOI21_candies)C++17
0 / 100
124 ms7244 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) { int left = l[j]; int right = r[j]; s[left] = min(s[left] + v[j], c[left]); s[right] = max(s[right] - v[j], 0); } for(int i = 1; i < n; ++i) { s[i] += s[i - 1]; s[i] = min(s[i], c[i]); } s[0] = min(s[0], c[0]); 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...