Submission #1325276

#TimeUsernameProblemLanguageResultExecution timeMemory
1325276eri16Distributing Candies (IOI21_candies)C++20
8 / 100
62 ms9680 KiB
#include <bits/stdc++.h>
#include "candies.h"

using namespace std;

using ll = long long;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v){

    int n=c.size();
    int m=l.size();

    vector <ll> ans(n,0);
    vector <int> vv(n+1,0);

    for(int i=0; i<m; i++){
        vv[l[i]]+=v[i];
        vv[r[i]+1]-=v[i];
    }
    
    ll cur=0;
    
    for(int i=0; i<n; i++){
        cur+=vv[i];
        ans[i]=min(cur,(ll)c[i]);
    }
    
    vector <int> ans2(n);
    
    for (int i=0; i<n; i++){
        ans2[i]=ans[i];
    }
    
    return ans2;
}
#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...