제출 #1334099

#제출 시각아이디문제언어결과실행 시간메모리
1334099activedeltorre사탕 분배 (IOI21_candies)C++20
0 / 100
59 ms10024 KiB
#include "candies.h"

#include <iostream>
#include <cassert>
#include <cstdio>
#include <vector>
int cap[200005];
int val[200005];
int spar[200005];
using namespace std;

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
    int n = c.size();
    for(int i=1;i<=n;i++)
    {
        cap[i]=c[i-1];
        val[i]=0;
    }
    for(int i=0;i<l.size();i++)
    {
        spar[l[i]+1]+=v[i];
        spar[r[i]+2]-=v[i];
    }
    vector<int>rasp;
    for(int i=1;i<=n;i++)
    {
        spar[i]=spar[i-1]+spar[i];
        rasp.push_back(min(cap[i],spar[i]));
    }
    return rasp;
}
#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...