2021.07.19【NOIP提高B组】模拟 玉米田（加强版）

思路：

直接设当前最外层的状态，然后转移
记得开O2

$code$

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<iostream>
#include<cstring>
#include<cstdio>

using namespace std;

int mod=1e8;
int a[22][22];
int f[2][1<<19];

int main()
{
	freopen("cowfood.in", "r", stdin);
	freopen("cowfood.out", "w", stdout);
	register int n, m;
	scanf("%d%d", &n, &m);
	for(register int i=1; i<=n; ++i)
		for(register int j=1; j<=m; ++j)
			scanf("%d", &a[i][j]);
	f[0][0]=1;
	register int tot=0;
	for(register int i=1; i<=n; ++i)
		for(register int j=0; j<m; ++j)
		{
			tot^=1;
			memset(f[tot], 0, sizeof(f[tot]));
			for(register int k=0; k<1<<m; ++k)
			{
				register int w=k&(1<<j);
				if(w)
				{
					f[tot][k^(1<<j)]+=f[tot^1][k];
					if(f[tot][k^(1<<j)]>mod)
						f[tot][k^(1<<j)]-=mod;
					continue;
				}
				if(a[i][j+1]==0)
				{
					f[tot][k]+=f[tot^1][k];
					if(f[tot][k]>mod)
						f[tot][k]-=mod;
					continue;
				}
				if((k&(1<<j-1)))
				{
					f[tot][k]+=f[tot^1][k];
					if(f[tot][k]>mod)
						f[tot][k]-=mod;
					continue;
				}
				f[tot][k^(1<<j)]+=f[tot^1][k];
				if(f[tot][k^(1<<j)]>mod)
					f[tot][k^(1<<j)]-=mod;
				f[tot][k]+=f[tot^1][k];
				if(f[tot][k]>mod)
					f[tot][k]-=mod;
			}
		}
	register int ans=0;
	for(register int i=0; i<1<<m; ++i)
	{
		ans+=f[tot][i];
		if(ans>mod)
			ans-=mod;
	}
	printf("%d", ans);
	return 0;
}