Submission #1028653

#	Time	Username	Problem	Language	Result	Execution time	Memory
1028653		JahonaliX	Distributing Candies (IOI21_candies)	C++17	0 / 100	67 ms	7252 KiB

candies

#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(), q = v.size();
    vector<int> a(n);
//    if (n <= 2000 && q <= 2000) {
//        for (int i = 0; i < q; ++i) for (int j = l[i]; j <= r[i]; ++j) a[j] = max(0, min(c[j], a[j] + v[i]));
//    }
//    else {
        bool ok = true;
        for (int i : v) ok &= i >= 0;
        if (ok) {
            for (int i = 0; i < q; ++i) {
                a[l[i]] += v[i];
                if (r[i] + 1 < n) a[r[i] + 1] -= v[i];
            }
            for (int i = 1; i < n; ++i) a[i] += a[i - 1];
            for (int i = 0; i < n; ++i) a[i] = min(a[i], c[i]);
        }
//        else {
//
//        }
//    }
    return a;
}

//int main() {
//    int n, q;
//    cin >> n >> q;
//    vector<int> c(n), l(q), r(q), v(q), a;
//    for (int &i : c) cin >> i;
//    for (int &i : l) cin >> i;
//    for (int &i : r) cin >> i;
//    for (int &i : v) cin >> i;
//    a = distribute_candies(c, l, r, v);
//    for (int i : a) cout << i << ' ';
//}

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