Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 16463 | Accepted: 8671 |
Description
Farmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some yummy corn for the cows on a number of squares. Regrettably, some of the squares are infertile and can't be planted. Canny FJ knows that the cows dislike eating close to each other, so when choosing which squares to plant, he avoids choosing squares that are adjacent; no two chosen squares share an edge. He has not yet made the final choice as to which squares to plant.
Being a very open-minded man, Farmer John wants to consider all possible options for how to choose the squares for planting. He is so open-minded that he considers choosing no squares as a valid option! Please help Farmer John determine the number of ways he can choose the squares to plant.
Input
Lines 2.. M+1: Line i+1 describes row i of the pasture with N space-separated integers indicating whether a square is fertile (1 for fertile, 0 for infertile)
Output
Sample Input
2 3 1 1 1 0 1 0
Sample Output
9
Hint
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.
Source
题意:给出一个M*N的矩阵,元素为0表示这个地方不能种玉米,为1表示这个地方能种玉米,现在规定所种的玉米不能相邻,即每行或者没列不能有相邻的玉米,问一共有多少种种植方法
解题思路:状态压缩,可以先预处理出每行能放的状态,然后dp[i][j]表示第i行在状态j下有几种种植方法
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <set>
using namespace std;
#define LL long long
const int INF = 0x3f3f3f3f;
const int mod = 100000000;
int n, m;
int a[15][15], dp[15][1 << 12], x[1 << 12];
void init()
{
int cnt= 0;
for (int i = 0; i<(1 << 12); i++)
if (!(i & i << 1)) x[cnt++] = i;
}
int check(int x, int p)
{
for (int i = 1; i <= m; i++)
if ((p & 1 << (i - 1)) && !a[x][i]) return 0;
return 1;
}
int main()
{
init();
while (~scanf("%d%d", &n, &m))
{
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
scanf("%d", &a[i][j]);
memset(dp, 0, sizeof dp);
for (int i = 1; i <= n; i++)
{
for (int j = 0; x[j]<(1 << m); j++)
{
if (!check(i, x[j])) continue;
if (i == 1) {dp[i][j] = 1;continue;}
for (int k = 0; x[k]<(1 << m); k++)
if (!(x[j] & x[k])) dp[i][j] += dp[i - 1][k],dp[i][j]%=mod;
}
}
int ans = 0;
for(int i = 0; x[i]<(1 << m); i++)
ans = (ans + dp[n][i]) % mod;
printf("%d\n", ans);
}
return 0;
}