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
83
84
85
86
87
88
89
90
#include <bits/stdc++.h>


using namespace std;


const int G = 65;
const int N = 50'001;

int requests[G][N];
int numRequests[G];


vector <int> solve(int n, int m, vector <int> &a) {
    const int maxGreed = *max_element(a.begin(), a.end());

    vector <int> res(n, 0), resNew(n, 0);
    res[n - 1] = m;

    int proposer = n - 1;
    for (int i = n - 2; i >= 0; i--) {
        for (int v = 1; v <= maxGreed; v++) {
            numRequests[v] = 0;
        }

        int needVotes = (n - i + 1) / 2 - 1 - (proposer - (i + 1));

        for (int j = n - 1; j >= proposer; j--) {
            resNew[j] = 0;
        }

        for (int j = n - 1; j >= proposer; j--) {
            int v = res[j] + a[j];
            if (v <= maxGreed) {
                requests[v][numRequests[v]++] = j;
            }
        }

        int mLeft = m;
        for (int v = 1; v <= maxGreed; v++) {
            if (needVotes == 0) {
                break;
            }

            if (mLeft < v * needVotes) {
                mLeft = -1;
                break;
            }

            for (int k = 0; k < numRequests[v]; k++) {
                if (needVotes == 0) {
                    break;
                }

                mLeft -= v;
                needVotes--;
                resNew[requests[v][k]] = v;
            }
        }

        if (mLeft < 0) {
            res[i] = -1;
        } else {
            resNew[i] = mLeft;
            swap(res, resNew);
            proposer = i;
        }
    }

    return res;
}

int main() {
    ios_base::sync_with_stdio(false);

    int n, m;
    cin >> n >> m;

    vector <int> a(n);
    for (int &ai : a) {
        cin >> ai;
    }

    auto ans = solve(n, m, a);
    for (int x : ans) {
        cout << x << ' ';
    }

    return 0;
}