题意:
有一块n*m(12)的玉米地。
每块地的情况用0和1来表示,0代表贫瘠,1代表肥沃,可以在肥沃的土地上种玉米。
现在问有几种方法来种玉米,使得每块玉米地都是没有邻接的。
e.g:
2 3 1 1 1 0 1 0Number the squares as follows:
1 2 3 4
There are four ways to plant only on one squares (1, 2, 3, or 4), three ways to plant on two squares (13, 14, or 34), 1 way to plant on three squares (134), and one way to plant on no squares. 4+3+1+1=9.
解析:
先把第一行所有符合的状态找出来,然后由于每一行的状态都由上一行的状态决定,所以dp搞就好了。
状态转移方程:
dp[ i ] [ j ] = Σ dp [ i - 1 ] [ k ]。
其中j,k为状态编号。
又是数组开小了wa了两发- -。
代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <climits>
#include <cassert>
#define LL long long
#define lson lo, mi, rt << 1
#define rson mi + 1, hi, rt << 1 | 1
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxt = (1 << 12) + 10;
const int maxn = 20;
int state[maxt];
int g[maxn];
LL dp[maxn][maxt];
//判断状态x是否有相邻的1
bool adjacented(int x)
{
if (x & (x << 1))
return true;
return false;
}
//判断状态x是否满足当前的图mp
bool ok(int x, int mp)
{
if (x & (~mp))
return false;
return true;
}
int main()
{
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif // LOCAL
int m, n;
while (~scanf("%d%d", &n, &m))
{
memset(dp, 0, sizeof(dp));
memset(state, 0, sizeof(state));
memset(g, 0, sizeof(g));
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
int x;
scanf("%d", &x);
if (x == 1)
g[i] |= (1 << (j - 1));
}
}
int cnt = 0;
for (int i = 0; i < (1 << m); i++)
{
if (!adjacented(i))
{
state[cnt++] = i;
}
}
for (int i = 0; i < cnt; i++)
{
if (ok(state[i], g[1]))
{
dp[1][i] = 1;
}
}
for (int i = 2; i <= n; i++)
{
for (int j = 0; j < cnt; j++)
{
if (!ok(state[j], g[i]))
continue;
for (int k = 0; k < cnt; k++)
{
if (!ok(state[k], g[i - 1]))
continue;
if (!(state[j] & state[k]))
{
dp[i][j] = (dp[i][j] + dp[i - 1][k]) % 100000000;
}
}
}
}
LL ans = 0;
for (int i = 0; i < cnt; i++)
{
ans = (ans + dp[n][i]) % 100000000;
}
printf("%lld\n", ans);
}
return 0;
}