제출 #564772

#제출 시각아이디문제언어결과실행 시간메모리
564772ngano_upat_na사탕 분배 (IOI21_candies)C++17
3 / 100
5083 ms13228 KiB
#include <iostream> #include <cmath> #include <vector> #include "candies.h" using namespace std; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { int n = c.size(), q = l.size(); vector<int> ans(n,0); for (int i=0; i<q; i++) { for (int j=l[i]; j<=r[i]; j++) { ans[j] = ((v[i] > 0) ? min(c[j], ans[j]+v[i]) : max(0, ans[j]+v[i])); } } return ans; }
#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...