poj2411Mondriaan's Dream(状态压缩dp)
来源:互联网 发布:巨人网络收购投哪网 编辑:程序博客网 时间:2024/04/30 14:51
Mondriaan's DreamTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Appoint description:
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!
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 21 31 42 22 32 42 114 110 0
Sample Output
10123514451205用2进制的01表示不放还是放第i行只和i-1行有关枚举i-1行的每个状态,推出由此状态能达到的i行状态如果i-1行的出发状态某处未放,必然要在i行放一个竖的方块,所以我对上一行状态按位取反之后的状态就是放置了竖方块的状态。然后用搜索扫一道在i行放横着的方块的所有可能,并且把这些状态累加上i-1的出发状态的方法数,如果该方法数为0,直接continue。#include<iostream>#include<cstring>#include<cstdlib>#include<cstdio>#include<cmath>#include<set>#include <queue>#include<algorithm>#include <vector>const double PI = acos(-1.0);using namespace std;long long dp[15][1 << 12], tep;//用tep记录上一行每个状态的dp值int h, w;void dfs(int a, int b, int c) //a为行, b为该行的状态, c为该行第几列{if(c >= w){dp[a][b] += tep;return;}dfs(a, b, c + 1);if(c + 2 <= w && ! (b & (1 <<c)) && !(b & (1 << (c + 1))))dfs(a, b + (1 << c) + (1 << (c + 1)), c + 2);}int main(){int i, j, k;while(scanf("%d%d", &h, &w) && (h + w)){if((h & 1) && (w & 1)){printf("0\n");continue;}memset(dp, 0, sizeof(dp));tep = 1;dfs(1, 0, 0);for(i = 2; i <= h; ++ i){for(j = 0; j < (1 << w); ++ j){if(dp[i - 1][j])tep = dp[i - 1][j];elsecontinue;dfs(i, ~j & ((1 << w) - 1), 0);//注意取反不能直接加~.}}printf("%lld\n", dp[h][(1 << w) - 1]);}}
0 0
- poj2411Mondriaan's Dream(状态压缩dp)
- POJ2411Mondriaan's Dream题解动态规划DP
- poj2411Mondriaan's Dream【覆盖类状压dp】
- poj2411Mondriaan's Dream
- poj2411Mondriaan's Dream题解
- poj2411 Mondriaan's Dream 状态压缩dp
- poj2411 Mondriaan's Dream 状态压缩dp
- 【poj2411】Mondriaan's Dream 状态压缩dp
- POJ_2411_Mondriaan's Dream【状态压缩DP】
- 【POJ2411】Mondriaan's Dream-状态压缩DP(插头DP?)
- pku 2411 Mondriaan's Dream(状态压缩DP)
- pku 2411 Mondriaan's Dream dp 状态压缩
- dp专辑F - Mondriaan's Dream [状态压缩]
- JOJ 2190: Mondriaan's Dream (状态压缩DP +DFS)
- POJ 2411 Mondriaan's Dream 状态压缩(DP)
- POJ 2411 Mondriaan's Dream 状态压缩DP
- POJ 2411 Mondriaan's Dream 状态压缩dp
- POJ 2411 Mondriaan's Dream(DP---状态压缩)
- Android笔记(二)SpannableString显示表情
- Android中的静态系统广播和动态系统广播
- Test of MV FAST refresh with Sum and group
- linux命令
- 应用上传不成功
- poj2411Mondriaan's Dream(状态压缩dp)
- 算法集合
- c调用c++函数(包括类成员函数)的方法
- ApplePay申请MerchantID及证书配置
- redis-cli 命令总结
- 双击鼠标HOOK学习
- 破解版 Sublime text3破解版下载以及安装emmet插件,前端开发神器
- 高等数学:第一章 函数与极限(3)无穷小 连续性 间断点 连续函数
- JVM > 运行时数据区域