POJ 2411 Mondriaan's Dream(插头DP,轮廓线)
来源:互联网 发布:javascript引用ku 编辑:程序博客网 时间:2024/06/10 01:41
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
题意:用1*2的小方格填满n*m的方案数
分析:轮廓线DP,由一格一格状态转化
代码;
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#include <stack>#include <map>#include <set>#include <vector>#include <queue>#define mem(p,k) memset(p,k,sizeof(p));#define rep(a,b,c) for(int a=b;a<c;a++)#define pb push_back#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define inf 0x3f3f3f3f#define ll long longusing namespace std;const int maxn=10;int n,m,ans;ll dp[2][100000];int main(){ while(~scanf("%d%d",&n,&m) && n+m){ if(n*m&1){ cout<<0<<endl;continue; } if(n<m)swap(n,m); mem(dp,0); int now=0; dp[now][(1<<m)-1]=1; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ now^=1; mem(dp[now],0); for(int k=0;k<(1<<m);k++){ if(dp[now^1][k]){ dp[now][k^(1<<j)]+=dp[now^1][k]; if(j && k&(1<<j) && !(k&1<<j-1)){ dp[now][k^1<<j-1]+=dp[now^1][k]; } } } } } cout<<dp[now][(1<<m)-1]<<endl; } return 0;}
阅读全文
0 0
- POJ 2411 Mondriaan's Dream(插头DP,轮廓线)
- POJ-2411-Mondriaan's Dream-轮廓线dp(插头dp)
- POJ 2411 Mondriaan's Dream 轮廓线动态规划,插头dp,滚动数组
- poj - 2411 - Mondriaan's Dream(轮廓线dp)
- POJ-2411 Mondriaan's Dream(轮廓线dp)
- poj 2411 Mondriaan's Dream 轮廓线dp
- POJ 2411 Mondriaan's Dream 轮廓线DP
- [POJ] 2411 Mondriaan's Dream [轮廓线dp]
- POJ 2411 Mondriaan's Dream [插头DP做法]
- T解 POJ-2411 Mondriaan's Dream [轮廓线DP] || [状压DP]
- POJ_P2411 Mondriaan's Dream(轮廓线DP)
- 【poj 2411】Mondriaan's Dream 状压dp(轮廓线性dp)
- poj_2411 Mondriaan's Dream(轮廓线dp)
- 【POJ2411】Mondriaan's Dream-状态压缩DP(插头DP?)
- poj2411 Mondriaan's Dream 插头dp做法
- poj2411 Mondriaan's Dream【插头dp】
- poj 2411 Mondriaan's Dream dp
- POJ 2411 Mondriaan's Dream (状压DP)
- 深度学习笔记——理论与推导之RNN的训练过程BPTT(五)
- MyApplication.java9
- POJ总结(1035)-Java
- 在Openfire上弄一个简单的推送系统
- java-重写/重载
- POJ 2411 Mondriaan's Dream(插头DP,轮廓线)
- 搭建项目,并与Gitlab构建连接的方法
- 紧张是意外发生的导火索
- Android笔记(16)retrofit上传图片
- Spring_001 安装spring在Eclipse的插件Spring Tool Suite™z指南
- json循环put数据
- Ubuntu14.04安装OpenCV3.0
- matplotlib 3D 数据
- vim_命令大全