Submission #788516

#TimeUsernameProblemLanguageResultExecution timeMemory
788516alexander707070Distributing Candies (IOI21_candies)C++17
8 / 100
81 ms13660 KiB
#include<bits/stdc++.h>
#define MAXN 1000007
using namespace std;
 
int n,q;
long long s,sum[MAXN];
vector<int> curr;

vector<int> distribute_candies(vector<int> c,vector<int> l,vector<int> r,vector<int> v){
    n=int(c.size()); q=int(l.size());
    curr.resize(n);

    for(int i=0;i<q;i++){
        sum[l[i]]+=v[i];
        sum[r[i]+1]-=v[i];
    }

    for(int i=0;i<n;i++){
        s+=sum[i];
        if(s>c[i])curr[i]=c[i];
        else curr[i]=s;
    }

    return curr;
}
#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...