poj2411 Mondriaan's Dream （状压dp）

 

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 21966		Accepted: 12313

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

#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
ll dp[20][(1 << 11) + 10], n, m;

void dfs(ll i, ll j, ll state, ll next) {
    //如果到达第n行
    if (j == n) {
        dp[i + 1][next] += dp[i][state];
        return;
    }
    //如果i列j位置没有放,那么横着放一块
    if (((1 << j) & state) == 0) dfs(i, j + 1, state, next | (1 << j));
    //如果i列j位置已经放,不去管它
    if (((1 << j) & state) > 0) dfs(i, j + 1, state, next);
    //如果i列j位置和i列j + 1位置都没有放,竖着放一块
    if ((j + 1 < n) && (((1 << j) & state) == 0) && (((1 << (j + 1)) & state) == 0)) dfs(i, j + 2, state, next);
    return;
}

int main() {
    while (scanf("%d %d", &n, &m) && (n != 0 && m != 0)) {
        memset(dp, 0, sizeof(dp));
        dp[1][0] = 1;
        for (ll i = 1; i <= m; i++) {
            for (ll j = 0; j < (1 << n); j++) {
                if (dp[i][j]) {
                    dfs(i, 0, j, 0);
                }
            }
        }
        printf("%lld\n", dp[m + 1][0]);
    }
    return 0;
}