1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    vector<int> b(n, -1);
    vector<int> d(n, 0);

    for (int i = 0; i < n; ++i) {
        int remaining = n - i;
        int required = (remaining + 1) / 2;
        int sum = 0;
        for (int j = i; j < n; ++j) {
            if (j == i) {
                b[j] = m - sum;
                break;
            }
            if (d[j] + a[j] <= b[j]) {
                sum += b[j];
                if (sum > m) break;
            }
        }
        if (sum <= m) {
            for (int j = i; j < n; ++j) {
                if (j == i) {
                    b[j] = m - sum;
                } else if (d[j] + a[j] <= b[j]) {
                    b[j] = b[j];
                } else {
                    b[j] = 0;
                }
            }
            break;
        } else {
            d[i] = b[i];
            b[i] = -1;
        }
    }

    for (int i = 0; i < n; ++i) {
        cout << b[i] << " ";
    }
    cout << endl;

    return 0;
}