BZOJ1725【状压DP】

最新推荐文章于 2020-08-09 00:23:58 发布

Lethelody

最新推荐文章于 2020-08-09 00:23:58 发布

阅读量636

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/Lethelody/article/details/45095391

版权

动态规划专栏收录该内容

24 篇文章 0 订阅

订阅专栏

/* I will wait for you */

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <string>
#define make make_pair
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;

const int maxn = 20;
const int maxm = 10010;
const int maxs = 26;
const int inf = 0x3f3f3f3f;
const int P = 100000000;
const double error = 1e-9;

inline int read()
{
	int x = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		  f = (ch == '-' ? -1 : 1), ch = getchar();
	while (ch >= '0' && ch <= '9')
	 	  x = x * 10 + ch - '0', ch = getchar();
	return x * f;
}

int n, m, a[maxm], f[maxn][maxm], ma[maxn];

void init()
{
	for (int i = 0; i < (1 << m); i++)
		if(!(i & (i << 1)) && !(i & (i >> 1)))
			a[i] = 1;
}

int main()
{
	n = read(), m = read(), init();

	for (int i = 1; i <= n; i++)
		for (int j = 1, c; j <= m; j++)
			c = read(), (ma[i] *= 2) += (c ^ 1);
	
	for (int i = 0; i < (1 << m); i++)
		if (a[i] && !(i & ma[1]))
			f[1][i] = 1;
	
	for (int i = 2; i <= n; i++)
		for (int j = 0; j < (1 << m); j++)
			if (f[i - 1][j])
				for (int k = 0; k < (1 << m); k++)
					if(a[k] && !(k & j) && !(k & ma[i]))
						(f[i][k] += f[i - 1][j]) %= P;
	
	int ans = 0;
	for (int i = 0; i < (1 << m); i++)
		(ans += f[n][i]) %= P;
	printf("%d\n", ans);
	
	return 0;
}