Submission #1243276

#	Time	Username	Problem	Language	Result	Execution time	Memory
1243276		nibert	Distributing Candies (IOI21_candies)	C++20	0 / 100	58 ms	8004 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);
    long long add_all = 0;
    for (int i = 0; i < q; i++) {
        int value = v[i];
        add_all += value;
    }
    vector<int> result(n);
    if(add_all > 0){
        for (int i=0; i < n; i ++){
            boxes[i] = min(1ll * c[i], add_all);
        }
    } else if(add_all < 0) {
        for (int i=0; i < n; i ++){
            boxes[i] = max(0ll, add_all);
        }
    } else {
        for (int i=0; i < n; i ++){
            boxes[i] = c[i];
        }
    }
    return boxes;
}

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