Submission #1063455

#	Time	Username	Problem	Language	Result	Execution time	Memory
1063455		deera	Distributing Candies (IOI21_candies)	C++17	3 / 100	68 ms	12880 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();

    if (n <= 2000 && q <= 2000) {
        vector<int> res(n, 0);
        for (int i = 0; i < q; i++) {
            for (int j = l[i]; j <= r[i]; j++) {
                res[j] = max(min(res[j] + v[i], c[j]), 0);
            }
        }
        return res;
    }

    bool non_neg = true;
    for (int val: v) if (val < 0) {
        non_neg = false;
        break;
    }

    if (non_neg) {
        // difference array
        vector<int> diff(n + 1, 0);

        for (int i = 0; i < q; i++) {
            diff[l[i]] += v[i];
            diff[r[i] + 1] -= v[i];
        }

        for (int i = 1; i < n; i++) {
            diff[i] += diff[i - 1];
        }

        vector<int> res(n, 0);
        for (int i = 0; i < n; i++) {
            res[i] = min(c[i], diff[i]);
        }

        return res;
    }

}

Compilation message (stderr)

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:45:1: warning: control reaches end of non-void function [-Wreturn-type]
   45 | }
      | ^

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