Submission #1243931

#TimeUsernameProblemLanguageResultExecution timeMemory
1243931QuentolosseDistributing Candies (IOI21_candies)C++20
3 / 100
5094 ms7240 KiB
#include "candies.h"

#include <bits/stdc++.h>
using namespace std;
// #define int long long

vector<signed> distribute_candies(vector<signed> c, vector<signed> l, vector<signed> r, vector<signed> v) {
    int n = c.size();
    int q = l.size();
    
    vector<int> bonbons(n, 0);
    for (int i = 0; i < q; i++)
    {
        for (int j = l[i]; j <= r[i]; j++)
        {
            bonbons[j] += v[i];
            bonbons[j] = min(bonbons[j], (int)c[j]);
            bonbons[j] = max(bonbons[j], (int)0);
        }
    }

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