제출 #1267865

#제출 시각아이디문제언어결과실행 시간메모리
1267865AlgorithmWarrior사탕 분배 (IOI21_candies)C++20
3 / 100
5093 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();
    vector<int>s(n,0);
    int i,j;
    int q=l.size();
    for(i=0;i<q;++i){
        for(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...