POJ 3254 Corn Fields（状压DP）

Corn Fields

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 16118		Accepted: 8509

Description

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.

Input

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)

Output

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

Sample Input

2 3
1 1 1
0 1 0

Sample Output

9

Hint

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.

Source

USACO 2006 November Gold

dp[i][j]表示遍历到第i行，第i行的状态为j时的方案的数量

状态转移：dp[k][i]=Σdp[k-1][j]  （ j为符合条件的所有状态 ）

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#define mod 100000000
const int inf=1<<30;
using namespace std;
int dp[20][10000],a[20],b[10000],m,n,cnt;
int judge(int x)
{
	if(x&(x<<1))
		return 0;
	return 1;
}
int main ()
{
	int i,j,k,x,ans=0;
	scanf("%d %d",&m,&n);
	for(i=0;i<(1<<n);i++)
	{
		if(judge(i))
		{
			b[++cnt]=i;
		}
	}
	for(i=1;i<=m;i++)
	{
		for(j=1;j<=n;j++)
		{
			scanf("%d",&x);
			if(x==0)
				a[i]+=(1<<(j-1));
		}
	}
	for(i=1;i<=cnt;i++)
	{
		if((b[i]&a[1])==0)
			dp[1][i]=1;
	}
	for(k=2;k<=m;k++)
	{
		for(i=1;i<=cnt;i++)
		{
			if(a[k]&b[i])
				continue;
			for(j=1;j<=cnt;j++)
			{
				if((a[k-1]&b[j]) || (b[i]&b[j]))
					continue;
				dp[k][i]=(dp[k][i]+dp[k-1][j])%mod;
			}
		}
	
	}
	for(i=1;i<=cnt;i++)
		ans=(ans+dp[m][i])%mod;
	printf("%d\n",ans);
	return 0;
}