#372579 (C++17(gcc12)) No.673 カブトムシ

• 問題: No.673 カブトムシ
• ユーザー: firiexp
• 提出日時: 2019-08-26 14:38:40
• 言語: C++17(gcc12) (gcc 12.4.0 + boost 1.89.0)
• 結果: CE (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 3,816 bytes
• コンパイル時間: 886 ms
• コンパイル使用メモリ: 101,268 KB
• 最終ジャッジ日時: 2026-03-08 21:16:04
• 合計ジャッジ時間: 1,224 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

コンパイルメッセージ

main.cpp: In instantiation of ‘struct SquareMatrix<modint<1000000007>, 2>’:
main.cpp:122:9:   required from here
main.cpp:23:9: error: ‘SquareMatrix<T, SIZE>::A’ has incomplete type
   23 |     mat A;
      |         ^
In file included from /usr/include/c++/12/bits/stl_map.h:63,
                 from /usr/include/c++/12/map:61,
                 from main.cpp:4:
/usr/include/c++/12/tuple:1610:45: note: declaration of ‘using mat = struct std::array<std::array<modint<1000000007>, 2>, 2>’ {aka ‘struct std::array<std::array<modint<1000000007>, 2>, 2>’}
 1610 |   template<typename _Tp, size_t _Nm> struct array;
      |                                             ^~~~~
main.cpp: In function ‘int main()’:
main.cpp:123:9: error: no match for ‘operator[]’ (operand types are ‘SquareMatrix<modint<1000000007>, 2>::ar’ {aka ‘std::array<modint<1000000007>, 2>’} and ‘int’)
  123 |     A[0][0] = mint(c); A[1][0] = 1; A[1][1] = 1;
      |         ^
main.cpp:123:28: error: no match for ‘operator[]’ (operand types are ‘SquareMatrix<modint<1000000007>, 2>::ar’ {aka ‘std::array<modint<1000000007>, 2>’} and ‘int’)
  123 |     A[0][0] = mint(c); A[1][0] = 1; A[1][1] = 1;
      |                            ^
main.cpp:123:41: error: no match for ‘operator[]’ (operand types are ‘SquareMatrix<modint<1000000007>, 2>::ar’ {aka ‘std::array<modint<1000000007>, 2>’} and ‘int’)
  123 |     A[0][0] = mint(c); A[1][0] = 1; A[1][1] = 1;
      |                                         ^
main.cpp:125:19: error: no match for ‘operator[]’ (operand types are ‘SquareMatrix<modint<1000000007>, 2>::ar’ {aka ‘std::array<modint<1000000007>, 2>’} and ‘int’)
  125 |     cout << ((A[0][0] + A[1][0]-mint(1))*mint(b)).val << "\n";
      |                   ^
main.cpp:125:29: error: no match for ‘operator[]’ (operand types are ‘SquareMatrix<modint<1000000007>, 2>::ar’ {aka ‘std::array<modint<1000000007>, 2>’} and ‘int’)

ソースコード

#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, size_t SIZE>
struct SquareMatrix {
    using ar = array<T, SIZE>;
    using mat = array<ar, SIZE>;
    mat A;
    SquareMatrix() = default;
    static SquareMatrix I(T e){
        SquareMatrix X;
        for (int i = 0; i < SIZE; ++i) {
            X[i][i] = e;
        }
        return X;
    }

    inline const ar &operator[](int k) const{ return (A.at(k)); }
    inline ar &operator[](int k) { return (A.at(k)); }
    SquareMatrix &operator+= (const SquareMatrix &B){
        for (int i = 0; i < SIZE; ++i) {
            for (int j = 0; j < SIZE; ++j) {
                (*this)[i][j] += B[i][j];
            }
        }
        return (*this);
    }

    SquareMatrix &operator-= (const SquareMatrix &B){
        for (int i = 0; i < SIZE; ++i) {
            for (int j = 0; j < SIZE; ++j) {
                (*this)[i][j] -= B[i][j];
            }
        }
        return (*this);
    }

    SquareMatrix &operator*=(const SquareMatrix &B) {
        SquareMatrix C;
        for (int i = 0; i < SIZE; ++i) {
            for (int j = 0; j < SIZE; ++j) {
                for (int k = 0; k < SIZE; ++k) {
                    C[i][j] += ((*this)[i][k] * B[k][j]);
                }
            }
        }
        A.swap(C.A);
        return (*this);
    }

    SquareMatrix pow(ll n) const {
        SquareMatrix a = (*this), res = I(T(1));
        while(n > 0){
            if(n & 1) res *= a;
            a *= a;
            n >>= 1;
        }
        return res;
    }
    SquareMatrix operator+(const SquareMatrix &B) const {return SquareMatrix(*this) += B;}
    SquareMatrix operator-(const SquareMatrix &B) const {return SquareMatrix(*this) -= B;}
    SquareMatrix operator*(const SquareMatrix &B) const {return SquareMatrix(*this) *= B;}
};

template <ll M = MOD> struct modint {
    ll val;
    modint(const ll x = 0) : val(x) {
        val = x;
        while(val < 0) val += M;
        while(val > M) val -= M;
    }

    modint operator+(const modint a) const { return modint(*this) += a; }
    modint operator-(const modint a) const { return modint(*this) -= a; }
    modint operator*(const modint a) const { return modint(*this) *= a; }
    modint operator/(const modint a) const { return modint(*this) /= a; }
    modint operator-() const { return modint(M-val); }
    modint inv() const {
        ll u = 1, v = 0, s = 0, t = 1, m = M, x = val;
        while (x) {ll q = m/x; swap(s -= q*u, u); swap(t -= q*v, v); swap(m -= q*x, x); }
        if(s < 0) s += M;
        return modint(s);
    }
    modint pow(ll n) const {
        ll u = 1, xx = val;
        while (n > 0){ if (n&1) u = u * xx % M; xx = xx * xx % M; n >>= 1; }
        return modint(u);
    }
    modint& operator+=(const modint a){ val += a.val; if(val >= M) val -= M; return *this; }
    modint& operator-=(const modint a){ val -= a.val; if(val < 0) val += M; return *this; }
    modint& operator*=(const modint a){ val = val * a.val % M; return *this; }
    modint& operator/=(const modint a){ val = val * a.inv().val % M; return *this;}

    modint& operator=(const int& x){
        val = x;
        while(val < 0) val += M;
        while(val > M) val -= M;
        return *this;
    }
};

using mint = modint<MOD>;
using mat = SquareMatrix<mint, 2>;
int main() {
    ll b, c, d;
    cin >> b >> c >> d;
    mat A;
    A[0][0] = mint(c); A[1][0] = 1; A[1][1] = 1;
    A = A.pow(d);
    cout << ((A[0][0] + A[1][0]-mint(1))*mint(b)).val << "\n";
    return 0;
}