제출 #529923

#제출 시각아이디문제언어결과실행 시간메모리
529923drdilyorDistributing Candies (IOI21_candies)C++17
0 / 100
5073 ms12208 KiB
#define ll long long #define ii pair<int, int> #define vi vector<int> #define vii vector<pair<int, int>> #define INF 1000000000 #include <bits/stdc++.h> using namespace std; vi distribute_candies(vi c, vi l, vi r, vi v) { int n = c.size(); int q = l.size(); vi res(n); for (int i = 0; i < q; i++) { for (int j = l[i]; j <= r[i]; j++) { res[j] += v[i]; if (res[j] > c[j]) res[j] = c[j]; } } return res; }
#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...