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
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<(int)b;++i)
#define FORD(i,a,b) for(int i=a;i>=(int)b;--i)
#define PB push_back
#define EB emplace_back
#define FI first
#define SE second
#define umap unordered_map
#define uset unordered_set
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vpii vector<pii>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ALL(X) (X).begin(),(X).end()
#ifndef DEBUG
#define endl (char)10
#endif
using namespace std;
using ll = long long;
using ld = long double;

template <class T>
istream& operator>> (istream& is, vector<T>& vec){
    FOR(i,0,vec.size()) is >> vec[i];
    return is;
}
template <class T>
ostream& operator<< (ostream& os, vector<T>& vec){
    for(auto& t : vec) os << t << " ";
    return os;
}
template<class T, class U>
ostream& operator<< (ostream& os, const pair<T, U>& p){
    os << p.FI << " " << p.SE;
    return os;
}
template<class T, class U>
istream& operator>> (istream& is, pair<T, U>& p){
    is >> p.FI >> p.SE;
    return is;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vi A(n);
    cin >> A;
    if(n == 1) {
        cout << m << endl;
        return 0;
    }
    vi ans(n, -1);
    ans[n - 2] = m;
    ans[n - 1] = 0;
    priority_queue<pii> Q;
    Q.emplace(-A[n - 1], n - 1);
    Q.emplace(-m - 1, n - 2);
    FORD(i,n-3,0) {
        int koszta = 0;
        int ilegl = (n - i + 1) / 2 - 1;
        vpii P;
        FOR(j,0,ilegl) {
            P.PB(Q.top());
            Q.pop();
            koszta += P.back().FI;
        }
        //cout << i << " " << koszta << endl;
        //cout << P << endl;
        if(koszta + m < 0) {
            FOR(j,0,ilegl) {
                Q.push(P[j]);
            }
            Q.emplace(0, i);
        } else {
            ans[i] = (koszta + m);
            FOR(j,i+1,n) ans[j] = 0;
            for(auto& [a, b] : P) ans[b] = -a;
            while(!Q.empty()) Q.pop();
            FOR(j,i,n) Q.emplace(-ans[j]-A[j], j);
            //cout << prop[i] << endl;
        }
    }
    cout << ans << endl;
}