제출 #1290337

#제출 시각아이디문제언어결과실행 시간메모리
1290337MMihalev사탕 분배 (IOI21_candies)C++20
0 / 100
46 ms6560 KiB
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include "candies.h"
using namespace std;
const int MAX_N=2e5+5;
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,std::vector<int> r, std::vector<int> v)
{
    vector<int>a;
    for(int i=0;i<l.size();i++)
    {
        for(int j=l[i];j<=r[i];j++)
        {
            if(v[i]>0)
            {
                a[j]=min(c[j],a[j]+v[i]);
            }
            else a[j]=max(0,a[j]+v[i]);
        }
    }
    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...