题意:给定N*M的棋盘上,放1*2,和2*2少了一个格子的两种方块。求总方案数。
状态压缩DP:f[i][j]表示第i行状态为j,前i-1行都填满的情况下的总方案数。
搜索(s1,s2)上一行和当前行两种合法的状态,转移。
dfs(p,s1,s2,b1,b2),第p列,前一行为s1,当前行为s2,前一列对当前列,前后两行的影响b1,b2。。
7种转移情况,详见代码:
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
![](https://images.cnblogs.com/OutliningIndicators/ExpandedBlockStart.gif)
#include<stdio.h> #include<string.h> #include<math.h> #define LL long long LL f[11][513]; int n,m; int deep; void dfs(int p,int s1,int s2,int b1,int b2){ //s1上一行,s2当前行 if (p == m){ if (b1 == 0 && b2==0){ f[deep+1][s2] += f[deep][s1]; } return ; } if (b2 == 0){ if (b1 == 0){ dfs(p+1, s1<<1,(s2<<1)+1,0,0);// //1 0 //1 0 dfs(p+1, s1<<1,(s2<<1)+1,1,0);// //1 1 //1 0 dfs(p+1, s1<<1,(s2<<1)+1,0,1); //1 0 //1 1 } dfs(p+1,(s1<<1)+1-b1,(s2<<1)+1,0,1); //0 0 //1 1 dfs(p+1,(s1<<1)+1-b1,(s2<<1)+1,1,1); //0 1 //1 1 } if (b1 == 0){ dfs(p+1,(s1<<1),(s2<<1)+b2,1,1); //1 1 //0 1 } dfs(p+1,(s1<<1)+1-b1,(s2<<1)+b2,0,0); //0 0 //0 0 return ; } int main() { scanf("%d%d",&n,&m); if (n < m){ int tmp = n; n = m; m = tmp; } f[0][(1<<m) - 1] = 1; for (deep = 0;deep < n;deep++){ dfs(0,0,0,0,0); //p,s1,s2,b1,b2 } printf("%I64d\n",f[n][(1<<m)-1]); return 0; }