Submission #1024204

#TimeUsernameProblemLanguageResultExecution timeMemory
1024204AbitoDistributing Candies (IOI21_candies)C++17
3 / 100
5078 ms13392 KiB
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,q;
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {

    n=c.size();
    q=l.size();
    vector<int> a(n,0);
    for (int j=0;j<q;j++){
        for (int i=l[j];i<=r[j];i++){
            a[i]+=v[j];
            if (a[i]<0) a[i]=0;
            if (a[i]>c[i]) a[i]=c[i];
        }
    }return a;
}
#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...