[USACO06NOV]玉米田Corn Fields

题目

https://www.luogu.org/problemnew/show/P1879

思路

用状态表示草地最外层，转移时按状态判断

代码

#include<cstdio>
using namespace std;
const int MOD=1e8;
int f[13][2100];
int can[13];
int donot[201];
bool judge(int x)
{
    return (x & (x>>1));
}
int main()
{
    int m,n; 
    scanf("%d%d",&m,&n);
    int x;
    int full=(1<<n)-1;
    for(int i=1;i<=m;i++)
    {
        for(int j=1;j<=n;j++)
        {
            scanf("%d",&x);
            if(!x) can[i]=can[i] | (1<<(n-j));
        }
    }
    int cnt=0;
    for(int i=0;i<=full;i++)
    {
      if(judge(i)) continue;
      donot[++cnt]=i;
    }
    int last,now;
    for(int i=1;i<=cnt;i++)
    {
        now=donot[i];
        if(donot[i] & can[1]) continue;
        f[1][i]=1;
    }
    for(int i=2;i<=m;i++)
    {
        for(int j=1;j<=cnt;j++)
        {
            last=donot[j];
            if(last & can[i-1]) continue;
            for(int k=1;k<=cnt;k++)
            {
                now=donot[k];
                if(now & can[i]) continue;
                if(now & last) continue;
                f[i][k]+=f[i-1][j];
                f[i][k]%=MOD;
            }
        }
    }
    int ans=0;
    for(int i=1;i<=cnt;i++) ans=(ans+f[m][i])%MOD;
    printf("%d",ans);
    return 0;
}