제출 #1307280

#제출 시각아이디문제언어결과실행 시간메모리
1307280opeleklanosDistributing Candies (IOI21_candies)C++20
3 / 100
5091 ms7392 KiB
#include <iostream>
#include <vector>
#include <algorithm>
#include "candies.h"
using namespace std;


vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v){
    vector<int> s(c.size(), 0);
    for(int i = 0; i<l.size(); i++){
        for(int j = l[i]; j<=r[i]; j++){
            if(v[i]>=0) s[j] = min(c[j], s[j] + v[i]);
            else s[j] = max(0, s[j] + v[i]);
        }
    }
    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...