Submission #769443

#TimeUsernameProblemLanguageResultExecution timeMemory
769443YassirSalamaDistributing Candies (IOI21_candies)C++17
3 / 100
79 ms14120 KiB
#include "candies.h"
#include<bits/stdc++.h>
#include <vector>
using namespace std;
#define ll long long
vector<int> distribute_candies(vector<int> c, vector<int> l,
                                    vector<int> r, vector<int> v) {
    int n = c.size();
    int q=v.size();
    vector<ll> s(n);
    if(n<=2000&&q<=2000){
        for(int j=0;j<q;j++){
            int lrr=l[j],rr=r[j],cc=v[j];
            for(int i=lrr;i<=rr;i++){
                s[i]=max(0LL,min((long long)c[i],s[i]+cc));
            }
        }
    }else{

    }
    vector<int> ans;
    for(auto x:s) ans.push_back(x);
    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...