POJ 3420 Quad Tiling（轮廓线DP+矩阵快速幂）

Quad Tiling

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4076		Accepted: 1856

Description

Tired of the Tri Tiling game finally, Michael turns to a more challengeable game, Quad Tiling:

In how many ways can you tile a 4 × N (1 ≤ N ≤ 10⁹) rectangle with 2 × 1 dominoes? For the answer would be very big, output the answer modulo M (0 < M ≤ 10⁵).

Input

Input consists of several test cases followed by a line containing double 0. Each test case consists of two integers, N and M, respectively.

Output

For each test case, output the answer modules M.

Sample Input

1 10000
3 10000
5 10000
0 0

Sample Output

1
11
95

Source

POJ Monthly--2007.10.06, Dagger

题目大意：

    有一个4*N的二维容器，放入1*2的砖块，求总方案数。

解题思路：

    明显轮廓线dp，由于有宽度为4，所以轮廓有1<<4=16种状态，不过我们手动模拟一下就可以发现只会出现其中的6种状态，状态转移也非常简单，直接手动构造矩阵，矩阵快速幂求得结果即可。（详细状态，及转移方程见下图，当时随便打的草稿，写的很随意请不要在意）

AC代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cmath>
using namespace std;
#define vec vector<int>
#define mat vector<vec>
#define LL long long

int N,M;

//计算A*B
mat mul(mat &A,mat &B)
{
    mat C(A.size(),vec(B[0].size()));
        for(int i=0;i<A.size();++i)
            for(int k=0;k<B.size();++k)
                if(A[i][k]!=0)//如果A[i][j]==0则一定为0
                    for(int j=0;j<B[0].size();++j)
                        C[i][j]=(C[i][j]+A[i][k]*B[k][j])%M;
    return C;
}

//计算A^B
mat pow(mat A,LL n)
{
    mat B(A.size(),vec(A.size()));
    for(int i=0;i<A.size();++i)
        B[i][i]=1;
    while(n>0)
    {
        if(n&1)
            B=mul(B,A);
        A=mul(A,A);
        n>>=1;
    }
    return B;
}

int main()
{
    while(~scanf("%d%d",&N,&M)&&(N||M))
    {
        mat b(6,vec(6));//状态转移方程矩阵
        b[0][0]=1; b[0][1]=1; b[0][2]=1; b[0][3]=1; b[0][4]=1; b[0][5]=0;
        b[1][0]=1; b[1][1]=0; b[1][2]=1; b[1][3]=0; b[1][4]=0; b[1][5]=0;
        b[2][0]=1; b[2][1]=1; b[2][2]=0; b[2][3]=0; b[2][4]=0; b[2][5]=0;
        b[3][0]=1; b[3][1]=0; b[3][2]=0; b[3][3]=0; b[3][4]=0; b[3][5]=1;
        b[4][0]=1; b[4][1]=0; b[4][2]=0; b[4][3]=0; b[4][4]=0; b[4][5]=0;
        b[5][0]=0; b[5][1]=0; b[5][2]=0; b[5][3]=1; b[5][4]=0; b[5][5]=0;
        printf("%d\n",pow(b,N)[0][0]);
    }
    
    return 0;
}