POJ 3254 Corn Fields

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <utility>
using namespace std;

#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)

#define Clean(x,y) memset(x,y,sizeof(x))
#define LL long long
#define ULL unsigned long long
#define inf 0x7fffffff
#define mod 100000000

int n,m;

int a[15][15];
int now[15]; //地图每一行的状态

vector<int> state[15]; //每一行的可行状态

int dp[15][1<<13];

void init()
{
scanf("%d%d",&n,&m);
rep(i,1,n)
{
now[i] = 0;
rep(j,1,m)
{
scanf("%d",&a[i][j]);
a[i][j] = 1 - a[i][j];
now[i] = now[i] * 2 + a[i][j];
}
}
int uplim = 1<<m;
state[0].clear();
state[0].push_back(0);
rep(i,1,n)
{
state[i].clear();
rep(j,0,uplim-1)
{
if ( now[i] & j ) continue; //放到障碍处
if ( j & (j<<1)  ) continue;
state[i].push_back(j);
}
}
}

void DP()
{
Clean(dp,0);
rep(i,0,state[1].size()-1) dp[1][i] = 1;
rep(i,2,n)
rep(j,0,state[i].size()-1)
rep(k,0,state[i-1].size()-1)
{
if ( state[i][j] & state[i-1][k] ) continue;
dp[i][j] += dp[i-1][k];
dp[i][j] %= mod;
}
int ans = 0;
rep(i,0,state
.size()-1)
ans = ( ans + dp
[i] ) % mod;
cout<<ans<<endl;
}

int main()
{
init();
DP();
return 0;
}