結果

問題 No.1112 冥界の音楽
コンテスト
ユーザー hedwig100
提出日時 2020-07-10 22:38:40
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 22 ms / 2,000 ms
コード長 3,944 bytes
コンパイル時間 1,870 ms
コンパイル使用メモリ 175,468 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-10-11 10:00:33
合計ジャッジ時間 2,795 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i ++)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;// = 998244353;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;
const int tyou[7] = {0,2,4,5,7,9,11};


template<int Modulus> 
struct ModInt {
    long long x;
    ModInt(long long x = 0) :x((x%Modulus + Modulus)%Modulus) {}
    constexpr ModInt &operator+=(const ModInt a) {if ((x += a.x) >= Modulus) x -= Modulus; return *this;}
    constexpr ModInt &operator-=(const ModInt a) {if ((x += Modulus - a.x) >= Modulus) x -= Modulus; return *this;}
    constexpr ModInt &operator*=(const ModInt a) {(x *= a.x) %= Modulus; return *this;}
    constexpr ModInt &operator/=(const ModInt a) {return *this *= a.inverse();}

    constexpr ModInt operator+(const ModInt a) const {return ModInt(*this) += a.x;}
    constexpr ModInt operator-(const ModInt a) const {return ModInt(*this) -= a.x;}
    constexpr ModInt operator*(const ModInt a) const {return ModInt(*this) *= a.x;}
    constexpr ModInt operator/(const ModInt a) const {return ModInt(*this) /= a.x;}
    
    friend constexpr ostream& operator<<(ostream& os,const ModInt<Modulus>& a) {return os << a.x;}
    friend constexpr istream& operator>>(istream& is,ModInt<Modulus>& a) {return is >> a.x;}
    
    ModInt inverse() const {// x ^ (-1) 
        long long a = x,b = Modulus,p = 1,q = 0;
        while (b) {long long d = a/b; a -= d*b; swap(a,b); p -= d*q; swap(p,q);}
        return ModInt(p);
    }
    ModInt pow(long long N) {// x ^ N 
        ModInt a = 1;
        while (N) {
            if (N&1) a *= *this;
            *this *= *this;
            N >>= 1;
        }
        return a;
    }
};

using mint = ModInt<1000000007>;
//using mint = ModInt<998244353>;
struct Combination {
    int N;
    //using mint = ModInt<1000000007>;
    //using mint = ModInt<998244353>;
    vector<mint> fact,ifact,invs;
    Combination(int N): N(N),fact(N + 1),ifact(N + 1) {
        fact[0] = fact[1] = 1;
        ifact[0] = ifact[1] = 1;
        for (int i = 2;i < N + 1;++i) {fact[i] = fact[i - 1] * i;}
        ifact[N] = fact[N].inverse();
        for (int i = N;i >= 1;--i) {ifact[i - 1] = ifact[i] * i;}
    }
    void invs_build() {
        invs.resize(N + 1);
        invs[1] = 1;
        for (int i = 2;i < N + 1;++i) invs[i] = fact[i] * ifact[i - 1];
    }
    mint operator()(int n, int k) {
        if (k < 0 || k > n) return 0;
        return fact[n]*ifact[k]*ifact[n - k];
    }
    mint npk(int n,int k) {
        if (k < 0 || k > n) return 0;
        return fact[n]*ifact[n - k];
    }
};

using Matrix = vector<vector<ll>>;
Matrix mat_mul(Matrix &A,Matrix &B,int mod = MOD) {
    Matrix ans(A.size(),vector<long long>(B[0].size(),0));
    for (int i = 0;i < A.size(); i++) {
        for (int j = 0;j < A[0].size();j ++) {
            for (int k = 0;k < A[0].size(); k++) {
                ans[i][j] += A[i][k]*B[k][j];
                ans[i][j] %= MOD;
            }
        }
    }
    return ans;
}

Matrix mat_pow(Matrix &A,long long N,int mod = MOD) {
    Matrix ans(A.size(),vector<long long>(A.size(),0));
    for (int i = 0;i < A.size();i ++) ans[i][i] = 1;
    Matrix X = A;
    while (N > 0) {
        if (N&1) ans = mat_mul(ans,X);
        N >>= 1;
        X = mat_mul(X,X);
    }
    return ans;
}

int main() {
    int K,M;
    ll N; cin >> K >> M >> N;
    Matrix A(K*K,vector<ll>(K*K,0));
    rep(i,M) {
        int p,q,r;
        cin >> p >> q >> r;
        --p; --q; -- r;
        A[K*q + r][K*p + q] += 1;
    }
    A = mat_pow(A,N - 2);
    //rep(i,K*K) {rep(j,K*K) {cout << A[i][j];} cout << '\n';}
    ll ans = 0;
    rep(i,K){
        rep(j,K) {
            ans += A[i*K][j];
            ans %= MOD;
        }
    } 
    cout << ans << '\n';
    return 0;
}
0