Corn Fields - POJ 3254（状态压缩）

#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;

const int MAX_N = 1<<12;
const int MAX_M = 13;
const int Mod = 1e8;

int dp[MAX_M][MAX_N];
int bit[1<<12], cnt, M, N;

void DFS(int layer, int state)
{
    if(layer >= N)
    {
        bit[cnt++] = state;
        return ;
    }
    DFS(layer+1, state);
    DFS(layer+2, state|(1<<layer));
}

int main()
{
    while(scanf("%d%d", &M, &N) != EOF)
    {
        int x, data[MAX_M]={0};

        cnt = 0;
        DFS(0, 0);

        for(int i=1; i<=M; i++)
        for(int j=0; j<N; j++)
        {
            scanf("%d", &x);
            data[i] = data[i] * 2 + (x^1);
        }

        memset(dp, 0, sizeof(dp));
        dp[0][0] = 1;

        for(int t=1; t<=M; t++)
        {
            for(int i=0; i<cnt; i++)if(!(data[t] & bit[i]))
            for(int j=0; j<cnt; j++)if(!(data[t-1]&bit[j]))
            {
                if(!(bit[i] & bit[j]))
                {
                    dp[t][i] += dp[t-1][j];
                    dp[t][i] %= Mod;
                }
            }
        }

        int ans = 0;

        for(int i=0; i<cnt; i++)
            ans = (ans+dp[M][i]) % Mod;

        printf("%d\n", ans);
    }

    return 0;
}