Pow of Matrix (Frobenius) (verify/linalg/pow_fast.test.cpp)

• View this file on GitHub
• Last update: 2025-12-17 02:23:31+01:00
• Problem: https://judge.yosupo.jp/problem/pow_of_matrix

Depends on

• cp-algo/linalg/frobenius.hpp
• cp-algo/linalg/matrix.hpp
• cp-algo/linalg/vector.hpp
• cp-algo/math/affine.hpp
• cp-algo/math/combinatorics.hpp
• cp-algo/math/common.hpp
• cp-algo/math/cvector.hpp
• cp-algo/math/fft.hpp
• cp-algo/math/poly.hpp
• cp-algo/math/poly/impl/div.hpp
• cp-algo/math/poly/impl/euclid.hpp
• cp-algo/number_theory/discrete_sqrt.hpp
• cp-algo/number_theory/modint.hpp
• cp-algo/random/rng.hpp
• cp-algo/util/big_alloc.hpp
• cp-algo/util/checkpoint.hpp
• cp-algo/util/complex.hpp
• cp-algo/util/simd.hpp

Code

// @brief Pow of Matrix (Frobenius)
#define PROBLEM "https://judge.yosupo.jp/problem/pow_of_matrix"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define CP_ALGO_MAXN 256
#include <bits/stdc++.h>
//#include "blazingio/blazingio.min.hpp"
#include "cp-algo/linalg/frobenius.hpp"

using namespace std;
using namespace cp_algo::math;
using namespace cp_algo::linalg;

const int64_t mod = 998244353;
using base = modint<mod>;
using polyn = poly_t<base>;

void solve() {
    size_t n;
    uint64_t k;
    cin >> n >> k;
    matrix<base> A(n);
    A.read();
    frobenius_pow(A, k).print();
}

signed main() {
    //freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 327, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	6 ms	4 MB
g++	example_01	AC	5 ms	4 MB
g++	example_02	AC	5 ms	4 MB
g++	frobenius_hack_00	AC	5 ms	4 MB
g++	lowrank_max_random_00	AC	24 ms	7 MB
g++	lowrank_max_random_01	AC	24 ms	7 MB
g++	max_random_00	AC	21 ms	7 MB
g++	max_random_01	AC	21 ms	7 MB
g++	max_random_02	AC	22 ms	7 MB
g++	max_random_03	AC	21 ms	7 MB
g++	max_random_worst_00	AC	21 ms	7 MB
g++	max_random_worst_01	AC	21 ms	7 MB
g++	max_random_worst_02	AC	22 ms	7 MB
g++	max_random_worst_03	AC	21 ms	7 MB
g++	nontrivial_frobenius_form_00	AC	30 ms	7 MB
g++	nontrivial_frobenius_form_01	AC	30 ms	7 MB
g++	nontrivial_frobenius_form_02	AC	29 ms	7 MB
g++	nontrivial_frobenius_form_03	AC	27 ms	7 MB
g++	nontrivial_frobenius_form_04	AC	26 ms	7 MB
g++	nontrivial_frobenius_form_05	AC	22 ms	7 MB
g++	nontrivial_frobenius_form_06	AC	24 ms	7 MB
g++	nontrivial_frobenius_form_07	AC	27 ms	7 MB
g++	nontrivial_frobenius_form_08	AC	26 ms	7 MB
g++	nontrivial_frobenius_form_09	AC	26 ms	7 MB
g++	perm_max_random_00	AC	19 ms	7 MB
g++	perm_max_random_01	AC	19 ms	7 MB
g++	random_00	AC	19 ms	6 MB
g++	random_01	AC	21 ms	7 MB
g++	random_02	AC	8 ms	4 MB
g++	signed_overflow_00	AC	5 ms	4 MB
g++	small_00	AC	4 ms	4 MB
g++	small_01	AC	4 ms	4 MB
g++	small_02	AC	4 ms	4 MB
g++	small_03	AC	4 ms	4 MB
g++	small_04	AC	4 ms	4 MB
g++	small_05	AC	4 ms	4 MB
g++	small_06	AC	4 ms	4 MB
g++	small_07	AC	4 ms	4 MB
g++	small_08	AC	4 ms	4 MB
g++	small_09	AC	4 ms	4 MB
g++	small_10	AC	4 ms	4 MB
g++	small_11	AC	4 ms	4 MB
g++	unsigned_overflow_00	AC	5 ms	4 MB

Back to top page