Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 18070 | Accepted: 9509 |
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
这道题作为状压DP入门题挺不错的,看了好多状压DP的题,终于找到了个简单一点的入门题!
题意:
N*M的农场放牛,1的地方是可以放的,0是不可放,且牛之间不可相邻,问有多少种放置方法。
思路:
dp[i][j]表示为第i行放置完牛后的状态为j的方法数。状态转移方程很容易知道是dp[i][j]=dp[i][j]+dp[i-1][k],k&j==0且j的1不相邻。
最后把dp[m]的所有方法数累加就行了。
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int mod=1e8;
int a[15],n,m;
int dp[15][5000];
int main()
{
while(~scanf("%d%d",&m,&n))
{
memset(a,0,sizeof(a));
memset(dp,0,sizeof(dp));
dp[0][0]=1;
int state=1<<n;
for(int i=1;i<=m;i++)
{
for(int j=0;j<n;j++)
{
int x;
scanf("%d",&x);
a[i]|=(x<<j);
}
}
for(int i=1;i<=m;i++)
{
for(int j=0;j<state;j++)//枚举所有状态
{
if((j&a[i])!=j) continue;//剔除掉与题目给的条件不符的
if(j&(j>>1)) continue;//剔除列相邻的
for(int k=0;k<state;k++)
{
if(k&j) continue;//剔除行相邻的
dp[i][j]=(dp[i][j]+dp[i-1][k])%mod;
}
}
}
int ans=0;
for(int i=0;i<state;i++)
{
ans=(ans+dp[m][i])%mod;
}
printf("%d\n",ans);
}
return 0;
}