Submission #443355

#TimeUsernameProblemLanguageResultExecution timeMemory
443355urd05Distributing Candies (IOI21_candies)C++17
3 / 100
5043 ms7348 KiB
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;

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