POJ 2411Mondriaan's Dream(类似hdu1992铺砖问题)

最新推荐文章于 2020-03-29 20:00:20 发布

果7

最新推荐文章于 2020-03-29 20:00:20 发布

阅读量1.7k

点赞数

分类专栏：动态规划文章标签：状压dp

本文链接：https://blog.csdn.net/coraline_m/article/details/22280949

版权

动态规划专栏收录该内容

27 篇文章 0 订阅

订阅专栏

Mondriaan's Dream

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 10591		Accepted: 6163

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

Sample Output

题目大意：和上个题目差不多，http://acm.hdu.edu.cn/showproblem.php?pid=1992。不过这个框框的大小是变化的。

解题思路：和上一个一样，状压dp，用0表示不占用下一行的，1表示占用下一行的情况。不过需要枚举列。然后找状态转移即可。会爆int32需要用long long..

hdu 1992题解：http://blog.csdn.net/coraline_m/article/details/22219621

题目地址：http://poj.org/problem?id=2411

AC代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;

long long dp[15][15][2050];

void dfs(int r,int c,int cur,int nex,int m)
{
    if(c>=m)
    {
        dp[r+1][m][nex]+=dp[r][m][cur];
        return;
    }
    if(!(cur&(1<<c)))
    {
        dfs(r,c+1,cur,nex|(1<<c),m);   //可以放一个1
        if(c<=m-2&&(!(cur&(1<<(c+1)))))  //可以放00
            dfs(r,c+2,cur,nex,m);
    }
    else
        dfs(r,c+1,cur,nex,m);
}

int main()
{
    int i,j,k;
    memset(dp,0,sizeof(dp));
    for(i=0;i<15;i++)
        dp[0][i][0]=1;   //把框框的列数确定找每一行的

    for(i=1;i<12;i++)  //确定列数
    {
        int tmp=1<<i;
        for(j=0;j<12;j++)   //确定每一行
        {
            for(k=0;k<tmp;k++)
                if(dp[j][i][k])
                    dfs(j,0,k,0,i);
        }
    }

    int n,m;
    while(cin>>n>>m)
    {
        if(n+m==0) break;
        cout<<dp[n][m][0]<<endl;
    }
    return 0;
}