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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    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> next_valid(n + 2);
    next_valid[n] = n;

    priority_queue<int, vector<int>, greater<int>> pq;

    for (int i = n - 1; i >= 0; --i) {
        int s = n - i;
        int required = (s + 1) / 2;
        int needed = required - 1;

        if (needed <= 0) {
            b[i] = m;
            pq.push(a[i] + b[i]);
            next_valid[i] = i;
            continue;
        }

        if (pq.size() < needed) {
            b[i] = -1;
            next_valid[i] = next_valid[i + 1];
            continue;
        }

        priority_queue<int, vector<int>, greater<int>> temp;
        int sum = 0;
        for (int j = 0; j < needed; ++j) {
            int val = pq.top();
            pq.pop();
            sum += val;
            temp.push(val);
        }

        if (sum > m) {
            b[i] = -1;
            next_valid[i] = next_valid[i + 1];
            while (!temp.empty()) {
                pq.push(temp.top());
                temp.pop();
            }
            continue;
        }

        b[i] = m - sum;
        next_valid[i] = i;

        while (!temp.empty()) {
            pq.push(temp.top());
            temp.pop();
        }
        pq.push(a[i] + b[i]);
    }

    for (int i = 0; i < n; ++i) {
        if (b[i] == -1) {
            int j = next_valid[i + 1];
            if (j >= n) {
                cout << -1 << " ";
                continue;
            }
            cout << (i == j ? b[j] : 0) << " ";
        } else {
            cout << b[i] << " ";
        }
    }

    return 0;
}