Submission #521530

#TimeUsernameProblemLanguageResultExecution timeMemory
521530marat0210사탕 분배 (IOI21_candies)C++17
0 / 100
5027 ms12192 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();
    int q = l.size();
    vector <int> res(n);
    for (int i = 0; i < n; ++i) {
        res[i] = c[i];
    }
    for (int i = 0; i < q; ++i) {
        if (v[i] > 0) {
            for (int j = l[i]; j <= r[i]; ++j) {
                res[j] = min(c[j], res[j] + v[i]);
            }
        }
        else {
            for (int j = l[i]; j <= r[i]; ++j) {
                res[j] = max(0, res[j] + v[i]);
            }
        }
    }
    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...