POJ 1684 Corn Fields(状压dp)

描述

Farmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some yummy corn for the cows on a number of squares. Regrettably, some of the squares are infertile and can't be planted. Canny FJ knows that the cows dislike eating close to each other, so when choosing which squares to plant, he avoids choosing squares that are adjacent; no two chosen squares share an edge. He has not yet made the final choice as to which squares to plant.

Being a very open-minded man, Farmer John wants to consider all possible options for how to choose the squares for planting. He is so open-minded that he considers choosing no squares as a valid option! Please help Farmer John determine the number of ways he can choose the squares to plant.

输入

Line 1: Two space-separated integers: M and N
Lines 2..M+1: Line i+1 describes row i of the pasture with N space-separated integers indicating whether a square is fertile (1 for fertile, 0 for infertile)

输出

Line 1: One integer: the number of ways that FJ can choose the squares modulo 100,000,000.

样例输入

2 3

1 1 1

0 1 0

扫描二维码关注公众号，回复： 2173130 查看本文章

样例输出

提示

Number the squares as follows:

1 2 3
  4

There are four ways to plant only on one squares (1, 2, 3, or 4), three ways to plant on two squares (13, 14, or 34), 1 way to plant on three squares (134), and one way to plant on no squares. 4+3+1+1=9.

题意

一块M*N的田用于养牛，1代表可以养牛，要求每头牛上下左右没有其他牛，问你方案数模1e9

题解

状压dp经典题，这里用样例解释

首先把列压成01串状态，1表示有牛，0表示无牛，那么总共有[000,111]总状态，000，001，010，011，100，101，110，111

dp[i][j]代表第i行可行状态j的方案总数，可行状态j的意思是没有两个连续的1，所以011和110和111去掉

state[i]代表可行的状态，所以只有000，001，010，100，101五种状态，此时所有可行状态数tot=5

cur[i]代表样例行的状态取反，取反是为了判断当前行枚举的五种状态是否可行，例如第二行题目是010，取反后是101，也就是说只有000，010两种状态可行

状态转移方程

if j∈[1,tot],state[j]&cur[i]=0,k∈[1,tot],state[k]&cur[i-1]=0,state[j]&state[k]=0

dp[i][j]=dp[i][j]+dp[i-1][k]表示当前行i状态j可由前一行i-1状态k转移过来

else

dp[i][j]=dp[i][j];

代码

 1 #include<stdio.h>
 2 #include<string.h>
 3 using namespace std;
 4 
 5 const int mod=1e9;
 6 
 7 int dp[15][1500],state[1500],cur[15];
 8 int n,m,k,tot;
 9 int main()
10 {
11     while(scanf("%d%d",&m,&n)!=EOF)
12     {
13         tot=0;
14         for(int i=0;i<(1<<n);i++)///列的所有可行状态
15             if(!(i&(i<<1)))///没有连续两个1
16                 state[++tot]=i;
17 
18         for(int i=1;i<=m;i++)
19             for(int j=1;j<=n;j++)
20             {
21                 scanf("%d",&k);
22                 if(!k)cur[i]+=1<<(n-j);///第i行不可行置1，用于判断不可行状态
23             }
24             
25         for(int i=1;i<=tot;i++)
26             if(!(state[i]&cur[1]))
27                 dp[1][i]=1;
28         for(int i=2;i<=m;i++)
29         {
30             for(int j=1;j<=tot;j++)///枚举当前状态
31             {
32                 if(state[j]&cur[i])continue;///当前状态不可行
33                 for(int k=1;k<=tot;k++)///枚举前一个状态
34                 {
35                     if(state[k]&cur[i-1])continue;///当前前一状态不可行
36                     if(state[j]&state[k])continue;///当前状态和前一状态不可行
37                     dp[i][j]=(dp[i][j]+dp[i-1][k])%mod;///当前状态可以从前一状态的K状态转移过来
38                 }
39             }
40         }
41         int ans=0;
42         for(int i=1;i<=tot;i++)
43             ans=(ans+dp[m][i])%mod;
44         printf("%d\n",ans);
45     }
46     return 0;
47 }

POJ 1684 Corn Fields(状压dp)

猜你喜欢