Submission #803130

#TimeUsernameProblemLanguageResultExecution timeMemory
803130vjudge1Distributing Candies (IOI21_candies)C++17
3 / 100
5077 ms13268 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(), q = l.size();
    vector<int> s(n);
    for(int i = 0; i < q; i++)
        for(int j = l[i]; j <= r[i]; j++)
            if(v[i]>0)
                s[j] = min(c[j], s[j]+v[i]);
            else
                s[j] = max(0, s[j]+v[i]);
    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...