bzoj 1875 矩阵快速幂

思路：不能走走过来的路，变点交换跑矩阵快速幂。

#include<bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mk make_pair
#define PII pair<int, int>
#define y1 skldjfskldjg
#define y2 skldfjsklejg
using namespace std;

const int N = 1e5 + ;
const int M = 5e5 + ;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = ;

int n, m, t, S, T, U[N], V[N], b[N];

struct Matrix {
    int a[][], n;

    Matrix(int _n) {
        n = _n;
        memset(a, , sizeof(a));
    }

    void init() {
        for(int i = ; i < n; i++)
            a[i][i] = ;
    }

    Matrix operator * (const Matrix &B) const {
        Matrix C(n);
        for(int i = ; i < n; i++)
            for(int j = ; j < n; j++)
                for(int k = ; k < n; k++)
                    C.a[i][j] = (C.a[i][j] + a[i][k] * B.a[k][j]) % mod;
        return C;
    }  

    Matrix operator ^ (int b) {
        Matrix A = (*this);
        Matrix ans(n);
        ans.init();
        while(b) {
            if(b & ) ans = ans * A;
            A = A * A; b >>= ;
        }
        return ans;
    }
};
int main() {
    scanf("%d%d%d%d%d", &n, &m, &t, &S, &T);
    for(int i = ; i <= m; i++) {
        scanf("%d%d", &U[i << ], &V[i << ]);
        U[i <<  | ] = V[i << ];
        V[i <<  | ] = U[i << ];
    }
    m = m <<  | ;
    Matrix A(m + );
    for(int i = ; i <= m; i++) {
        if(U[i] == S) A.a[][i] = ;
        if(V[i] == T) A.a[i][] = ;
        for(int j = ; j <= m; j++)
            if(V[i] == U[j] && (i ^ j) != )
                A.a[i][j] = ;
    }
    A = A ^ (t + );
    printf("%d\n", A.a[][]);
    return ;
}