Submission #442952

#TimeUsernameProblemLanguageResultExecution timeMemory
442952benedict0724Distributing Candies (IOI21_candies)C++17
8 / 100
131 ms12940 KiB
#include "candies.h"

#include <vector>
using namespace std;
typedef long long ll;

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();
    int q = l.size();
    std::vector<ll> s(n);
    for(int i=0;i<q;i++)
    {
        s[l[i]] += v[i];
        if(r[i] < n-1) s[r[i]+1] -= v[i];
    }
    for(int i=1;i<n;i++) s[i] += s[i-1];
    for(int i=0;i<n;i++) s[i] = min(s[i], (ll)c[i]);
    vector<int> ans(n);
    for(int i=0;i<n;i++) ans[i] = s[i];
    return ans;
}
#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...