Submission #1242466

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242466		nibert	사탕 분배 (IOI21_candies)	C++20	3 / 100	5093 ms	7328 KiB

candies

#include <vector>
#include <algorithm>
using namespace std;

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

    for (int j = 0; j < q; ++j) {
        for (int k = l[j]; k <= r[j]; ++k) {
            if (v[j] > 0) {
                int add = min(v[j], c[k] - curr[k]);
                curr[k] += add;
            } else {
                int remove = min(-v[j], curr[k]);
                curr[k] -= remove;
            }
        }
    }

    return curr;
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 8
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 33