제출 #500232

#제출 시각아이디문제언어결과실행 시간메모리
500232sazid_alamDistributing Candies (IOI21_candies)C++17
0 / 100
5040 ms8116 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();
    vector<int> s(n, 0), sum(n + 1, 0);

    for(int i = 0; i < (int)v.size(); i++){
        for(int j = l[i]; j <= r[i]; j++){
            if(v[j] > 0) s[j] = min(c[j], s[j] + v[j]);
            else s[j] = max(0, s[j] + v[j]);
        }
    }

    return s;
}
#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...