2015 Multi-University Training Contest 10 （hdu5411 CRB and Puzzle）

Problem Description
CRB is now playing Jigsaw Puzzle.
There are N kinds of pieces with infinite supply.
He can assemble one piece to the right side of the previously assembled one.
For each kind of pieces, only restricted kinds can be assembled with.
How many different patterns he can assemble with at most M pieces? (Two patterns P and Q are considered different if their lengths are different or there exists an integer j such that j-th piece of P is different from corresponding piece of Q.)
 

Input
There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:
The first line contains two integers N, M denoting the number of kinds of pieces and the maximum number of moves.
Then N lines follow. i-th line is described as following format.
k a1 a2 ... ak
Here k is the number of kinds which can be assembled to the right of the i-th kind. Next k integers represent each of them.
1 ≤ T ≤ 20
1 ≤ N ≤ 50
1 ≤ M ≤ 105
0 ≤ k ≤ N
1 ≤ a1 < a2 < … < ak ≤ N

 

Output
For each test case, output a single integer - number of different patterns modulo 2015.
 

Sample Input
1
3 2
1 2
1 3
0
 

Sample Output
6
Hint
possible patterns are ∅, 1, 2, 3, 1→2, 2→3

题意：有 N种拼图，其中每种拼图后面只能接给定的几种拼图 ，问接成不超过 M长度的拼图的方案数是多少

思路：离散学过，将其看为路径组合，这样路径点与点之间距离设为1得到邻接矩阵M后可以发现，就是求(M^1)+(M^2)+...(M^n)。

代码：来自：https://blog.csdn.net/qq_26594571/article/details/47951735

#define N 60
#define MOD 2015
struct matix{
    int ma[N][N];

    matix(){
        for(int i=0;i<N;i++){
            for(int j=0;j<N;j++){
                ma[i][j]=0;
            }
        }
    }

    matix operator *(const matix another){
        matix ans;

        for(int i=0;i<N;i++){
            for(int j=0;j<N;j++){
                for(int k=0;k<N;k++){
                    ans.ma[i][k]=(ans.ma[i][k]+ma[i][j]*another.ma[j][k])%MOD;
                }
            }
        }

        return ans;
    }
};

matix pow(matix x,int y){
    matix ans;

    for(int i=0;i<N;i++){
        ans.ma[i][i]=1;
    }

    while(y)
    {
        if(y%2)
        {
            ans=ans*x;
        }
        x=x*x;
        y=y/2;
    }

    return ans;
}

int main(){
    int t;
    int n,m;
    int cou;
    int a;

    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        matix now;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&cou);
            for(int j=1;j<=cou;j++)
            {
                scanf("%d",&a);
                now.ma[i-1][a-1]=1;
            }
        }
        for(int i=0;i<=n;i++)
        {
            now.ma[i][n]=1;
        }
        for(int i=0;i<n;i++)
        {
            now.ma[n][i]=0;
        }
        now=pow(now,m-1);

        int ans=1;

        for(int i=0;i<n;i++)
        {
            for(int j=0;j<=n;j++)
            {
                ans=(ans+now.ma[i][j])%MOD;
            }
        }
        printf("%d\n",ans);
    }
}