結果
問題 | No.572 妖精の演奏 |
ユーザー |
|
提出日時 | 2019-12-02 12:56:16 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 2,939 bytes |
コンパイル時間 | 846 ms |
コンパイル使用メモリ | 102,324 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-24 09:14:14 |
合計ジャッジ時間 | 1,566 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 20 |
ソースコード
#include <limits>#include <iostream>#include <algorithm>#include <iomanip>#include <map>#include <set>#include <queue>#include <stack>#include <numeric>#include <bitset>#include <cmath>static const int MOD = 1000000007;using ll = long long;using u32 = uint32_t;using namespace std;template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;template<class T>struct matrix {vector<vector<T>> A;matrix() = default;matrix(size_t n, size_t m) : A(n, vector<T>(m)) {}explicit matrix(size_t n) : A(n, vector<T> (n)) {};size_t height() const { return (A.size()); }size_t width() const { return (A[0].size()); }const vector<T> &operator [] (int k) const { return A[k]; }vector<T> &operator[] (int k) { return A[k]; }static matrix I(size_t n){matrix mat(n);for (int i = 0; i < n; ++i) mat[i][i] = 0;return mat;}matrix &operator+= (const matrix &B){size_t h = height(), w = width();for (int i = 0; i < h; ++i) {for (int j = 0; j < w; ++j) {(*this)[i][j] += B[i][j];}}}matrix &operator-= (const matrix &B){size_t h = height(), w = width();for (int i = 0; i < h; ++i) {for (int j = 0; j < w; ++j) {(*this)[i][j] -= B[i][j];}}}matrix &operator*=(const matrix &B){size_t n = height(), m = B.width(), p = width();matrix C (n, m);for (int i = 0; i < n; ++i) {for (int j = 0; j < m; ++j) {for (int k = 0; k < p; ++k) {C[i][j] = max(C[i][j], (*this)[i][k] + B[k][j]);}}}A.swap(C.A);return (*this);}template <class U>matrix &operator%= (const U &m){for (int i = 0; i < height(); ++i) {for (int j = 0; j < width(); ++j) {(*this)[i][j] %= m;}}}matrix pow(ll n) const {matrix a = (*this), res = I(height());while(n > 0){if(n & 1) res *= a;a *= a;n >>= 1;}return res;}matrix operator+(const matrix &A) const {return matrix(*this) += A;}matrix operator-(const matrix &A) const {return matrix(*this) -= A;}matrix operator*(const matrix &A) const {return matrix(*this) *= A;}template <class U>matrix operator%(const U &m) const {return matrix(*this) %= m;}};int main() {int n, m;cin >> n >> m;matrix<ll> A(m);for (int i = 0; i < m; ++i) {for (int j = 0; j < m; ++j) {cin >> A[i][j];}}A = A.pow(n-1);ll ans = 0;for (int i = 0; i < m; ++i) {for (int j = 0; j < m; ++j) {ans = max(ans, A[i][j]);}}cout << ans << "\n";return 0;}