Submission #1270917

#TimeUsernameProblemLanguageResultExecution timeMemory
1270917nerrrminDistributing Candies (IOI21_candies)C++20
3 / 100
5093 ms7236 KiB
#include "candies.h"

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2005;
int n, q;
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
    n = c.size();
    q = l.size();
    std::vector<int> s(n, 0);
    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...