【poj3254】 Corn Fields

// poj3254
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LL long long
#define MOD 100000000
#define inf 2147483640
#define Pi acos(-1.0)
#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);
using namespace std;

int a[1000010],f[20][100010],n,m;

bool check(int x,int flag) {
	if ((a[x]&flag)!=flag) return 0;   //是否符合地图
	if ((flag&(flag<<1))!=0 || (flag&(flag>>1))!=0) return 0;   //是否有相邻
	return 1;
}
int main() {
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++) {
		int x;a[i]=0;
		for (int j=1;j<=m;j++) {
			scanf("%d",&x);
			a[i]=(a[i]<<1)+x;
		}
	}
	f[0][0]=1;
	int maxl=1<<m;
	for (int i=1;i<=n;i++) 
		for (int j=0;j<maxl;j++) {   //枚举当前行状态
			if (check(i,j)==0) continue;
			for (int k=0;k<maxl;k++) {   //枚举上一行状态
				if ((j&k)!=0) continue;
				f[i][j]=f[i][j]+f[i-1][k];
				f[i][j]%=MOD;
			}
		}
	int ans=0;
	for (int i=0;i<maxl;i++) ans=(ans+f[n][i])%MOD;
	printf("%d\n",ans);
	return 0;
}