POJ 2411
来源:互联网 发布:json文件格式转换工具 编辑:程序博客网 时间:2024/06/07 16:09
一道很经典的状态压缩DP,网上已经有很好的解题报告(http://www.cnblogs.com/scau20110726/archive/2013/03/14/2960448.html)就请大家移步去看看吧!
代码(G++):
#include <iostream>#include <cstring>#define MAX 11using namespace std;long long dp[MAX+1][1<<MAX];bool check(int s){ while(s) { if(s & 1) { if(s>>1 & 1) s >>= 2; else return false; }else s >>= 1; } //cout<<1<<endl; return true;}bool check2(int ss, int s, int w){ for(int i=0; i<w; i++) { if(!(ss & 1) && !(s & 1)) return false; else{ ss >>= 1; s >>=1; } } return true;}int main(){ int h, w; while(cin>>h>>w && h+w!=0) { if(h*w & 1) { cout<<0<<endl; continue; } if(h < w) swap(h, w); //cout<<h<<'\t'<<w<<endl; memset(dp, 0, sizeof(dp)); for(int s=0; s<(1<<w); s++) { if(check(s)) dp[0][s] = 1; } for(int i=1; i<h; i++) { for(int s=0; s<(1<<w); s++) { for(int ss=0; ss<(1<<w); ss++) { if(check2(ss, s, w) && check(s & ss)) dp[i][s] += dp[i-1][ss]; } } } /*for(int i=0; i<h; i++) { for(int j=0; j<(1<<w); j++) cout<<dp[i][j]<<'\t'; cout<<endl; }*/ cout<<dp[h-1][(1<<w)-1]<<endl; } return 0;}
题目:(部分图没有粘过来)
Mondriaan’s Dream
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
- poj 2411
- poj 2411
- poj 2411
- poj 2411
- POJ 2411
- poj-2411
- POJ 2411
- poj 2411
- POJ 2411
- poj 2411 动态规划
- poj 2411 java
- poj 2411 新写法
- poj 2411 (状态压缩)
- HDU 1400 && POJ 2411
- poj 2411 zoj1100
- POJ 2411-状压dp
- POJ 2411 解题报告
- poj 2411| 插头dp
- C#随机数
- DirectShow示例CAMSchedule找不到编译错误的解决
- BitmapFactory.Options详解
- ADB not responding. If you'd like to retry, then please manually kill "adb.exe" and click 'Restart'
- 初见倾心,土曼第三代智能手表T-Ripple新体验
- POJ 2411
- struts学习之HelloWorld
- IntelliJ IDEA 10.5.1 引用外部Jar包
- Xcode真机调试失败:The identity used to sign the executable is no longer valid
- IOS pod update 慢慢慢
- 机械振动 趋势项产生原因
- Error:Execution failed for task ':app:mergeDebugResources'. > Some file crunching failed, see logs f
- Mongodb 设置过期时间Expire Date
- mac下,redis的安装与配置