poj 2411(插头DP 简单题)
2011-05-17 15:24
585 查看
Mondriaan's DreamTime Limit: 3000MS Memory Limit: 65536K
Total Submissions: 5930 Accepted: 3414
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
分析:再贴一个简单的插头DP。。。
代码:
Total Submissions: 5930 Accepted: 3414
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
分析:再贴一个简单的插头DP。。。
代码:
#include<cstdio> #include<cstring> using namespace std; long long f[2][1<<11]; int i,j,s,p=0,c=1,n,m; int main() { while (scanf("%d%d",&n,&m),n!=0) { if (n*m%2){puts("0");continue;} memset(f[c],0,sizeof(f[c])); f[c][0]=1; for (i=0; i<n; ++i) for (j=0; j<m; ++j) { p=!p,c=!c; memset(f[c],0,sizeof(f[c])); for (s=0; s<1<<m; ++s) if (f[p][s]) { f[c][s^1<<j]+=f[p][s]; if(j>0&&(s&1<<j-1)&&(!(s&1<<j)))f[c][s^1<<j-1]+=f[p][s]; } } printf("%lld/n",f[c][0]); } }
相关文章推荐
- POJ 2411 Mondriaan's Dream 轮廓线动态规划,插头dp,滚动数组
- POJ 2411 插头DP
- poj2411 Mondriaan's Dream 插头dp做法
- 插头DP——从不会到入门(POJ 2411,HDU 1565,HDU 2167,HDU 1693,Ural 1519)
- POJ 2411 Mondriaan's Dream [插头DP做法]
- poj 2411| 插头dp
- POJ-2411-Mondriaan's Dream-轮廓线dp(插头dp)
- POJ 2411 Mondriaan's Dream 插头dp
- POJ 2411 Mondriaan's Dream ——状压DP 插头DP
- poj2411 Mondriaan's Dream【插头dp】
- POJ - 2411 插头dp
- POJ 2411 Mondriaan's Dream(插头DP,轮廓线)
- POJ 1185 炮兵阵地 状态压缩DP简单题
- poj 1192(简单树形dp)
- POJ 2411 Mondriaan's Dream(状压DP)
- poj 2411 Mondriaan's Dream 状态压缩dp
- 【poj 2411】Mondriaan's Dream 状态压缩DP
- POJ (简单 dp ,最长升序子串)
- POJ 2411 Mondriaan's Dream(状态DP)
- 【状态压缩dp 入门】POJ - 2411 Mondriaan's Dream