Submission #446270

#TimeUsernameProblemLanguageResultExecution timeMemory
446270blueDistributing Candies (IOI21_candies)C++17
3 / 100
5070 ms13124 KiB
#include "candies.h"
#include <vector>
using namespace std;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v)
{
    int n = c.size();
    int q = l.size();
    
    vector<int> res(n, 0);

    for(int j = 0; j < q; j++)
    {
        for(int i = l[j]; i <= r[j]; i++)
        {
            if(v[j] > 0)
                res[i] = min(res[i] + v[j], c[i]);
            else
                res[i] = max(res[i] + v[j], 0);
        }
    }

    return res;
}
#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...