hdu 5731 Solid Dominoes Tilings(多米诺骨牌)

多米诺骨牌是 2 × 1 或 1 × 2 的矩形。

考虑用多米诺骨牌覆盖 m × n 棋盘，如果无法通过一条不穿过任何骨牌内部的直线，将一种覆盖方案分割成两个部分，那么这种覆盖方案被称为是稳定的。

例如，下图中 (a), (b) 是稳定的，(c), (d) 是不稳定的。

对于 m × n 的棋盘，有多少种稳定的多米诺骨牌的覆盖方案？

题意:

有1*2和2*1的多米诺骨牌,考虑用多米诺骨牌覆盖 m × n 棋盘，如果无法通过一条不穿过任何骨牌内部的直线，将一种覆盖方案分割成两个部分，那么这种覆盖方案被称为是稳定的。

对于 m × n 的棋盘，有多少种稳定的多米诺骨牌的覆盖方案？

 

思路:

预处理出任意放的dp[i][j],表示长为i,宽为j的方案数,

然后对列进行2^(m-1)的枚举,枚举的时候在对行就行容斥

#include<bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
long long dp[17][17]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,0,0,3,0,11,0,41,0,153,0,571,0,2131,0,7953,0,29681,0,1,5,11,36,95,281,781,2245,6336,18061,51205,145601,413351,1174500,3335651,9475901,0,0,8,0,95,0,1183,0,14824,0,185921,0,2332097,0,29253160,0,366944287,0,1,13,41,281,1183,6728,31529,167089,817991,4213133,21001799,106912793,536948224,720246619,704300462,289288426,0,0,21,0,781,0,31529,0,1292697,0,53175517,0,188978103,0,124166811,0,708175999,0,1,34,153,2245,14824,167089,1292697,12988816,108435745,31151234,940739768,741005255,164248716,498190405,200052235,282756494,0,0,55,0,6336,0,817991,0,108435745,0,479521663,0,528655152,0,764896039,0,416579196,0,1,89,571,18061,185921,4213133,53175517,31151234,479521663,584044562,472546535,732130620,186229290,274787842,732073997,320338127,0,0,144,0,51205,0,21001799,0,940739768,0,472546535,0,177126748,0,513673802,0,881924366,0,1,233,2131,145601,2332097,106912793,188978103,741005255,528655152,732130620,177126748,150536661,389322891,371114062,65334618,119004311,0,0,377,0,413351,0,536948224,0,164248716,0,186229290,0,389322891,0,351258337,0,144590622,0,1,610,7953,1174500,29253160,720246619,124166811,498190405,764896039,274787842,513673802,371114062,351258337,722065660,236847118,451896972,0,0,987,0,3335651,0,704300462,0,200052235,0,732073997,0,65334618,0,236847118,0,974417347,0,1,1597,29681,9475901,366944287,289288426,708175999,282756494,416579196,320338127,881924366,119004311,144590622,451896972,974417347,378503901};
int block[17];
long long Dp[17];

long long solve(int n,int m){
    long long ans=0;
    for(int i=0;i<(1<<m-1);i++){
        int Count=0,b_size=0;
        for(int j=0;j<m-1;j++){
            if((1<<j)&i){
                block[Count++]=b_size+1;
                b_size=0;
            }
            else    b_size++;
        }
        block[Count++]=b_size+1;
        for(int j=1;j<=n;j++)  //前面多少行的方案数
             for(int k=0;k<j;k++){
                long long cnt=1;
                for(int num=0;num<Count;num++)
                    cnt=cnt*dp[block[num]][j-k]%MOD;
                if(!k)  Dp[j]=cnt;
                else    Dp[j]=((Dp[j]-Dp[k]*cnt%MOD)%MOD+MOD)%MOD;
             }
        //printf("%lld\n",Dp[n]);
        if(Count%2==0)
            ans=((ans-Dp[n])+MOD)%MOD;
        else
            ans=(ans+Dp[n])%MOD;
        //printf("%lld\n",ans);
    }
    return ans;
}

int main(){
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
        printf("%lld\n",solve(n,m));
    return 0;
}