#549271 (C++17) No.572 妖精の演奏

• 問題: No.572 妖精の演奏
• ユーザー: Mister
• 提出日時: 2020-09-06 21:33:07
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 53 ms / 2,000 ms
• コード長: 1,894 bytes
• コンパイル時間: 1,014 ms
• コンパイル使用メモリ: 81,040 KB
• 最終ジャッジ日時: 2025-01-14 08:02:25
• ジャッジサーバーID （参考情報）: judge5 / judge4

ファイルパターン	結果
other	AC * 20

ソースコード

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 <iostream>
#include <vector>
using lint = long long;
constexpr lint INF = 1LL << 60;
template <class T>
struct Matrix {
    using M = std::vector<std::vector<T>>;
    int h, w;
    M mat;
    // constructor
    Matrix(int h, int w, T val = -INF)
        : h(h), w(w), mat(h, std::vector<T>(w, val)) {}
    static Matrix id(int n) {
        Matrix m(n, n);
        for (int i = 0; i < n; ++i) m[i][i] = 0;
        return m;
    }
    // getter
    std::vector<T>& operator[](int i) { return mat[i]; }
    std::vector<T> operator[](int i) const { return mat[i]; }
    typename M::iterator begin() { return mat.begin(); }
    typename M::iterator end() { return mat.end(); }
    // arithmetic
    Matrix operator*(const Matrix& m) const { return Matrix(*this) *= m; }
    template <class U>
    Matrix pow(U k) {
        Matrix ret = id(h);
        Matrix a = *this;
        while (k > 0) {
            if (k & 1) ret *= a;
            a *= a;
            k >>= 1;
        }
        return ret;
    }
    // compound assignment
    Matrix& operator*=(const Matrix& m) {
        std::vector<std::vector<T>> nmat(h, std::vector<T>(m.w, T(0)));
        for (int i = 0; i < h; ++i) {
            for (int j = 0; j < m.w; ++j) {
                for (int k = 0; k < w; ++k) {
                    nmat[i][j] = std::max(nmat[i][j], mat[i][k] + m[k][j]);
                }
            }
        }
        mat = nmat;
        return *this;
    }
};
void solve() {
    lint n;
    int m;
    std::cin >> n >> m;
    Matrix<lint> mat(m, m);
    for (auto& v : mat) {
        for (auto& x : v) std::cin >> x;
    }
    mat = mat.pow(n - 1);
    lint ans = -INF;
    for (auto& v : mat) {
        for (auto& x : v) ans = std::max(ans, x);
    }
    std::cout << ans << "\n";
}
int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    solve();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX