제출 #1064202

#제출 시각아이디문제언어결과실행 시간메모리
1064202glupanDistributing Candies (IOI21_candies)C++17
0 / 100
72 ms13032 KiB
#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(), q = l.size();
    vector<int>s(n);
    vector<int> pref(n+1,0);
    for(int i=0; i<q; i++) {
        pref[l[i]] += v[i];
        pref[r[i]+1] -= v[i];
    }
    for(int i=1; i<=n; i++)
        pref[i]+=pref[i-1];
    for(int i=0; i<n; i++)
        s[i] = min(c[i],pref[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...