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
91
92
93
94
95
96
97
98
99
// clang-format off
#include <bits/stdc++.h>

using namespace std;

#define ALL(x) (x).begin(), (x).end()

template<class C> void mini(C &a5, C b5) { a5 = min(a5, b5); }
template<class C> void maxi(C &a5, C b5) { a5 = max(a5, b5); }

#ifdef LOCAL
const bool debug = true;
#else
const bool debug = false;
#define cerr if (true) {} else cout
#endif
// clang-format on

#define int long long
#define double long double

const int INF = 1e18;
const int mod = 1e9 + 7;

int n, k, m;
const int nax = 7010;
int dp[nax][nax];
vector<pair<int, int>> cuksy[nax];

void first_dp() {
    for (int i = 0; i < nax; i++) {
        for (int j = 0; j < nax; j++) {
            dp[i][j] = INF;
        }
    }
    dp[0][0] = 0;
    for (int kk = 1; kk <= k; kk++) {
        for (int r = 0; r < m; r++) {
            for (auto &cuks : cuksy[kk]) {
                mini(dp[kk][(r + cuks.first) % m], dp[kk - 1][r] + cuks.second);
            }
        }
    }
}

void second_dp() {
    int *dp2 = dp[k];
    dp2[0] = 0;
    // exit(0);

    priority_queue<pair<int, int>, vector<pair<int, int>>,
                   greater<pair<int, int>>>
        pq;
    for (int r = 0; r < m; r++) {
        if (dp2[r] != INF) {
            pq.push({dp2[r], r});
        }
    }

    while (pq.size()) {
        auto [cost, r] = pq.top();
        pq.pop();

        if (cost != dp2[r])
            continue;

        for (int rr = 0; rr < m; rr++) {
            int r_sum = (r + rr) % m;
            if (dp2[r_sum] > cost + dp[k][rr]) {
                dp2[r_sum] = cost + dp[k][rr];
                pq.push({dp2[r_sum], r_sum});
            }
        }
    }

    for (int i = 0; i < m; i++) {
        cout << (dp2[i] == INF ? -1 : dp2[i]) << '\n';
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> k >> m;

    for (int i = 0; i < n; i++) {
        int t, w, c; // type, weight, cost
        cin >> t >> w >> c;
        cuksy[t].push_back({w, c});
    }

    first_dp();
    second_dp();

    return 0;
} /*

 */