Submission #1195281

#TimeUsernameProblemLanguageResultExecution timeMemory
1195281clementineDistributing Candies (IOI21_candies)C++20
0 / 100
46 ms9640 KiB
#include "candies.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

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