제출 #1219061

#제출 시각아이디문제언어결과실행 시간메모리
1219061brintonDistributing Candies (IOI21_candies)C++20
0 / 100
5095 ms7236 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]) v[i] = c[i];
            if(ans[i] < 0) v[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...