Mondriaan’s Dream
Time Limit: 3000MS Memory Limit: 65536K
Total Submissions: 25952 Accepted: 14221
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
题解:状态dp要求着对于所规定的的长方形进行相关的状态模拟---------二进制模拟,以及状态的模拟即可解决本题。
#include<set>
#include<cmath>
#include<ctime>
#include<queue>
#include<cstdio>
#include<vector>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
#define inf 1000000000
#define ll long long
#define pa pair<ll,int>
using namespace std;
int n,m;
ll f[12][1<<11];
bool in_s[1<<11];
int main()
{
while(cin>>n>>m&&n)
{
for(int i=0;i< 1<<m;i++)
{
bool cnt=0,has_odd =0;
for(int j=0;j<m;j++)
{
if(i>>j & 1) has_odd|=cnt,cnt=0;
else cnt^=1;
}
in_s[i] = has_odd|cnt? 0:1;
}
f[0][0]=1;
for(int i=1;i<=n;i++)
{
for(int j=0;j< 1<<m;j++)
{
f[i][j]=0;
for(int k=0;k< 1<<m;k++)
{
if((j&k)==0&&in_s[j|k])
{
f[i][j]+=f[i-1][k];
}
}
}
}
cout<<f[n][0]<<endl;
}
}