Submission #836515

#TimeUsernameProblemLanguageResultExecution timeMemory
836515FulopMate사탕 분배 (IOI21_candies)C++17
3 / 100
5097 ms13232 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();
    vector<int> s(n);

    int q = l.size();

    for(int i = 0; i < q; i++){
        for(int j = l[i]; j <= r[i]; j++){
            s[j]+=v[i];
            s[j] = max(0, 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...