Submission #1243000

#	Time	Username	Problem	Language	Result	Execution time	Memory
1243000		nibert	Distributing Candies (IOI21_candies)	C++20	0 / 100	5094 ms	7240 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 = r.size();
    vector<int> boxes(n, 0);
    for (int i = 0; i < q; i++){
        int left = l[i], right = r[i], value = v[i];
        if (value > 0){
            for (int j = left; j <= right; j++){
            boxes[j] = min(c[i], boxes[j] + value);
            }
        } else {
            for (int j = left; j <= right; j++){
                boxes[j] = max(0, boxes[j] + value);
            }
        }    
    }
    return boxes;
}

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