제출 #435781

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