sgu 131 状压DP

棋盘覆盖（二）

时间限制：1000 ms  |  内存限制：65535 KB

 

 

描述

The banquet hall of Computer Scientists' Palace has a rectangular form of the size M x N (1<=M<=9, 1<=N<=9). It is necessary to lay hardwood floors in the hall. There are wood pieces of two forms:
1) rectangles (2x1) 
2) corners (squares 2x2 without one 1x1 square) 
You have to determine X - the number of ways to cover the banquet hall. 
Remarks. The number of pieces is large enough. It is not allowed to leave empty places, or to cover any part of a surface twice, or to saw pieces.

 

输入

The first line contains natural number M. The second line contains a natural number N.

输出

First line should contain the number X, or 0 if there are no solutions.

样例输入

2 3

样例输出

5

题意：
有1*2的砖块和2*2但缺一个角的砖块，用他们恰好铺满m*n的矩形有几种方案。
代码：

//思路就是：状压,从上到下铺dfs，sta表示本行的状态，next表示下一行的状态，每次要把sta铺满
//,next随之变化。最后要m+1行的状态为0才可以。
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
ll dp[][<<];
int n,m;
bool chak(int sta,int x){
    int tmp=(sta&(<<x));
    return !tmp;
}
void dfs(int sta,int next,int col,int row,ll w){
    if(col==n){
        dp[row+][next]+=w;
        return;
    }
    if(sta&(<<col)) dfs(sta,next,col+,row,w); //不放
    else{
        int st=(sta|(<<col));
        if(chak(next,col)){
            dfs(sta|(<<col),next|(<<col),col+,row,w);//竖着的1*2
            if(col+<n&&chak(sta,col+))
                dfs(st|(<<(col+)),next|(<<col),col+,row,w);//缺右上角的2*2
            st=(next|(<<col));
            if(col+<n&&chak(next,col+))
                dfs(sta|(<<col),st|(<<(col+)),col+,row,w);//缺右下角的2*2
            if(col->=&&chak(next,col-))
                dfs(sta|(<<col),st|(<<(col-)),col+,row,w);//缺左下角的2*2
        }
        st=(sta|(<<col));
        if(col+<n&&chak(sta,col+)){
            dfs(st|(<<(col+)),next,col+,row,w);//横着的1*2
            if(chak(next,col+))
                dfs(st|(<<(col+)),next|(<<(col+)),col+,row,w);//缺左上角的2*2
        }
    }
}
int main()
{
    while(scanf("%d%d",&m,&n)==){
        memset(dp,,sizeof(dp));
        dp[][]=;
        int N=(<<n);
        for(int i=;i<=m;i++){
            for(int j=;j<N;j++){
                if(dp[i][j])
                    dfs(j,,,i,dp[i][j]);
            }
        }
        printf("%lld\n",dp[m+][]);
    }
    return ;
}