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
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1000'000'007LL;
const int N = 1000'007;
int tab[N], gr[N];
pair<int, int> cur[N];

void Solve()
{
    int n, k;
    cin >> n >> k;
    for(int i = 1; i <= n; ++i)
        cin >> gr[i];
    if(n == 1)
        {cout << k << "\n"; return;}
    tab[n - 1] = k; tab[n] = 0;
    for(int i = n - 2; i >= 1; --i)
    {
        int nd = (n - i) / 2;
        for(int j = 1; j <= n - i; ++j)
            if(tab[i + j] == -1)
                cur[j] = make_pair(0, -(i + j));
            else
                cur[j] = make_pair(tab[i + j] + gr[i + j], -(i + j));
        sort(cur + 1, cur + 1 + (n - i));
        int s = 0;
        for(int j = 1; j <= nd; ++j)
            s += cur[j].st;
        if(s > k)
            {tab[i] = -1; continue;}
        for(int j = i + 1; j <= n; ++j)
            tab[j] = 0;
        tab[i] = k - s;
        for(int j = 1; j <= nd; ++j)
            tab[-cur[j].nd] = cur[j].st;
    }
    for(int i = 1; i <= n; ++i)
        cout << tab[i] << " ";
    cout << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //int t; cin >> t;
    //while(t--)
        Solve();

    return 0;
}