제출 #1219062

#제출 시각아이디문제언어결과실행 시간메모리
1219062brintonDistributing Candies (IOI21_candies)C++20
3 / 100
5094 ms7244 KiB
#include "candies.h" #include <bits/stdc++.h> 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> ans(N,0); for(int q = 0;q < Q;q++){ for(int i = l[q];i <= r[q];i++){ ans[i] += v[q]; if(ans[i] > c[i]) ans[i] = c[i]; if(ans[i] < 0) ans[i] = 0; } } 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...