[动态规划]Pku2411--Mondriaan's Dream

Mondriaan's Dream

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 3732		Accepted: 2156

Description

Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series' (where he had to use his toilet paper to draw on, for all of his paper was filled with squares and rectangles), he dreamt of filling a large rectangle with small rectangles of width 2 and height 1 in varying ways.

Expert as he was in this material, he saw at a glance that he'll need a computer to calculate the number of ways to fill the large rectangle whose dimensions were integer values, as well. Help him, so that his dream won't turn into a nightmare!

Input

The input contains several test cases. Each test case is made up of two integer numbers: the height h and the width w of the large rectangle. Input is terminated by h=w=0. Otherwise, 1<=h,w<=11.

Output

For each test case, output the number of different ways the given rectangle can be filled with small rectangles of size 2 times 1. Assume the given large rectangle is oriented, i.e. count symmetrical tilings multiple times.

Sample Input

1 2
1 3
1 4
2 2
2 3
2 4
2 11
4 11
0 0

Sample Output

1
0
1
2
3
5
144
51205

Source

Ulm Local 2000

题目大意：给出一个n*m的棋盘，问用1*2的多米诺骨牌将其完全覆盖有多少种不同的方案。

分析：经典的状态压缩动态规划。n和m最大都只有11，所以可以采用状态压缩，即用一个二进制数表示每一行的状态。

定义f[i,j]表示前i-1行已经完全覆盖，第i行的状态为j的时候的方案数。则f[i,j]=∑f[i-1,k]。k能通过放置骨牌使第i-1行被完全覆盖，且第i行状态为j。这个状态转移可以用dfs来实现。

在开始动态规划之前，要先用dfs预处理出第一行可能的状态。对于第一行，只有两种可能操作：

1、不放。-->dfs(x+1,now shl 1)；

2、横放。-->dfs(x+2,now shl 2 or 3)；

当x等于m+1时，说明得到了一种可行状态，inc(f[1,now])；当x大于m时，退出dfs。

状态转移时的dfs过程与此类似，只是多了一种竖放操作而已，运用位运算实现，留给读者自己思考，或参考程序。

codes：

const maxn=(1 shl 11)-1; var n,m:int64; i:longint; f:array[1..11,0..maxn] of int64; procedure init(x,now:longint); begin if x=m+1 then inc(f[1,now]); if x>m then exit; init(x+1,now shl 1); init(x+2,now shl 2 or 3); end; procedure dfs(x,last,new:longint); begin if x=m+1 then inc(f[i,new],f[i-1,last]); if x>m then exit; dfs(x+1,last shl 1 or 1,new shl 1); dfs(x+1,last shl 1,new shl 1 or 1); dfs(x+2,last shl 2 or 3,new shl 2 or 3); end; procedure main; var t:longint; begin if m>n then begin t:=n; n:=m; m:=t; end; fillchar(f,sizeof(f),0); init(1,0); for i:=2 to n do dfs(1,0,0); writeln(f[n,(1 shl m)-1]); end; begin readln(n,m); while n+m<>0 do begin main; readln(n,m); end; end.