linalg/matrix_inv.hpp

• View this file on GitHub
• Last update: 2024-11-01 21:56:32+09:00
• Include: #include "linalg/matrix_inv.hpp"

Required by

• linalg/adjugate_matrix.hpp
• linalg/det_A_plus_xB.hpp
• linalg/frobenius.hpp
• linalg/matrix_lowrank_update.hpp

Verified with

• test/2_library_checker/linear_algebra/adjugate_matrix.test.cpp
• test/2_library_checker/linear_algebra/inverse_matrix.test.cpp
• test/2_library_checker/linear_algebra/pow_of_matrix_frobenius.test.cpp
• test/3_yukicoder/1303.test.cpp
• test/3_yukicoder/1774.test.cpp
• test/3_yukicoder/1907.test.cpp

Code

#pragma once

// (det, invA) をかえす

template <typename T>
pair<T, vc<vc<T>>> matrix_inv(vc<vc<T>> A) {
  T det = 1;
  int N = len(A);
  vv(T, B, N, N);
  FOR(n, N) B[n][n] = 1;
  FOR(i, N) {
    FOR(k, i, N) if (A[k][i] != 0) {
      if (k != i) {
        swap(A[i], A[k]), swap(B[i], B[k]);
        det = -det;
      }
      break;
    }
    if (A[i][i] == 0) return {T(0), {}};
    T c = T(1) / A[i][i];
    det *= A[i][i];
    FOR(j, i, N) A[i][j] *= c;
    FOR(j, N) B[i][j] *= c;
    FOR(k, N) if (i != k) {
      T c = A[k][i];
      FOR(j, i, N) A[k][j] -= A[i][j] * c;
      FOR(j, N) B[k][j] -= B[i][j] * c;
    }
  }
  return {det, B};
}

#line 2 "linalg/matrix_inv.hpp"

// (det, invA) をかえす

template <typename T>
pair<T, vc<vc<T>>> matrix_inv(vc<vc<T>> A) {
  T det = 1;
  int N = len(A);
  vv(T, B, N, N);
  FOR(n, N) B[n][n] = 1;
  FOR(i, N) {
    FOR(k, i, N) if (A[k][i] != 0) {
      if (k != i) {
        swap(A[i], A[k]), swap(B[i], B[k]);
        det = -det;
      }
      break;
    }
    if (A[i][i] == 0) return {T(0), {}};
    T c = T(1) / A[i][i];
    det *= A[i][i];
    FOR(j, i, N) A[i][j] *= c;
    FOR(j, N) B[i][j] *= c;
    FOR(k, N) if (i != k) {
      T c = A[k][i];
      FOR(j, i, N) A[k][j] -= A[i][j] * c;
      FOR(j, N) B[k][j] -= B[i][j] * c;
    }
  }
  return {det, B};
}

Back to top page