[状压dp][铺瓷砖] Mondriaan's Dream

Mondriaan's Dream

原题链接

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

---

---

#include
#include
using namespace std;
const int mod = 1e9+7;
int n, m;
int dp[110][1 << 10];
int main () {
    while(1) {
        cin >> n >> m;
        if (n == 0 || m == 0) break;
        if (n < m) swap(n, m);
        memset(dp, 0, sizeof dp);
        dp[0][(1 << m) - 1] = 1;
        for (int i = 1; i <= n; i++) {
            for (int j = 0; j < (1 << m); j++) {
                for (int k = 0; k < (1 << m); k++) {
                    bool ok = true;
                    int tk = k;
                    for (int s = 0; s < m; s++) {
                        if (!(j & (1 << s))) {
                            if (tk & (1 << s)) {
                                tk -= (1 << s);
                            } else {
                                ok= false;
                                break;
                            }
                        }
                    }
                    if (ok) {
                        for (int s = 0; s < m; s++) {
                            if (tk & (1 << s)) {
                                if (s + 1 < m && (tk & (1 << (s + 1)))) {
                                    tk -= (1 << s);
                                    tk -= (1 << (s + 1));
                                } else {
                                    ok = false;
                                    break;
                                }
                            }
                        }
                    }
                    if (ok) {
                        dp[i][k] += dp[i - 1][j];
                        dp[i][k] %= mod;
                    }
                }
            }
        }
        cout << dp[n][(1 << m) - 1] << endl;
    }
    return 0;
}