제출 #1229065

#제출 시각아이디문제언어결과실행 시간메모리
1229065LudisseyDistributing Candies (IOI21_candies)C++20
0 / 100
102 ms17732 KiB
#include "candies.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define all(a) (a.begin(), a.end())
#define sz(a) (int)a.size()

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();
    vector<int> s(n);
    vector<vector<int>> event(n+1);
    for (int i = 0; i < sz(l); i++)
    {
        event[l[i]].push_back(v[i]);
        event[r[i]+1].push_back(-v[i]);
    }
    int sm=0;
    for (int i = 0; i < n; i++)
    {
        for (auto u :event[i]) sm+=u;
        s[i]=min(c[i],sm);        
    }
    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...