POJ3254(入门状态压缩dp)

Corn Fields

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 13203		Accepted: 6921

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

Line 1: Two space-separated integers: M and N 
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

Line 1: One integer: the number of ways that FJ can choose the squares modulo 100,000,000.

Sample Input

2 3
1 1 1
0 1 0

Sample Output

9

第一道状态压缩dp，水一水
题目大意： 农夫有一块地，被划分为m行n列大小相等的格子，其中一些格子是可以放牧的（用1标记），农夫可以在这些格子里放牛，其他格子则不能放牛（用0标记），并且要求不可以使相邻格子都有牛。
现在输入数据给出这块地的大小及可否放牧的情况，求该农夫有多少种放牧方案可以选择（注意：任何格子都不放也是一种选择，不要忘记考虑！

 //2016.8.8
 #include<iostream>
 #include<cstdio>
 #include<cstring>

 using namespace std;

 const int mod = ;
 int arr[][];
 int dp[][<<];//dp[i][j]表示第ｉ行第ｊ种状态时的方法数。
 int state[<<];//记录可行的状态，即两两不相邻，以减少枚举次数。
 int cur[];//根据输入记录该行的状态。
 int len;//可行状态总数

 bool ok(int sta)//判断状态两两不相邻
 {
     return (sta&(sta<<))==?true:false;
 }

 void init(int m)//初始化可行状态
 {
     len = ;
     for(int i = ; i < (<<m); i++)
       if(ok(i))state[len++] = i;
 }

 bool fit(int sta, int k)//判断状态sta是否满足第k行的状态要求
 {
     return (sta&cur[k])==?true:false;
 }

 int main()
 {
     int n, m;
     while(cin>>n>>m)
     {
         init(m);
         for(int i = ; i < n; i++)
         {
           int feifa = ;
           for(int j = ; j < m; j++)
           {
             scanf("%d", &arr[i][j]);
             if(arr[i][j]==)feifa += (<<(m-j-));//0为不可以放牛，反向存为１
           }
           cur[i] = feifa;
         }
         memset(dp, , sizeof(dp));
         for(int i = ; i < len; i++)//初始化第一行dp值
           if(fit(state[i], ))
             dp[][i] = ;
         for(int i = ; i < n; i++)
         {
             for(int j = ; j < len; j++)
             {
                 if(fit(state[j], i))//如果状态state[j]满足该行i的要求，把上一行可行状态的方法数加起来
                 {
                     for(int k = ; k < len; k++)//枚举上一行(第i-1行)的状态
                     {
                         if(!fit(state[k], i-))continue;//排除不满足i-1行要求的状态
                         if(state[k]&state[j])continue;//排除不满足状态state[j]的状态
                         dp[i][j] = (dp[i][j]+dp[i-][k])%mod;
                     }
                 }
             }
         }
         int ans = ;
         for(int i = ; i < len; i++)//答案是最后一行填各个状态的方法数之和
           ans = (ans+dp[n-][i])%mod;
         cout<<ans<<endl;
     }

     return ;
 }