Submission #442946

#TimeUsernameProblemLanguageResultExecution timeMemory
442946benedict0724Distributing Candies (IOI21_candies)C++17
0 / 100
5094 ms7248 KiB
#include "candies.h"

#include <vector>
using namespace std;

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
    int n = c.size();
    int q = l.size();
    std::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(c[j], 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...