状压dp之不相连块

传送门

一块田里草地格子不能相邻，问有几种方案。

预处理不相邻块

 #include<iostream>
 #include<cstdio>
 #include<algorithm>
 #include<vector>
 #include<cstring>
 #include<map>
 #include<set>
 #include<queue>
 #include<bitset>
 #include<utility>
 #include<functional>
 #include<iomanip>
 #include<sstream>
 #include<ctime>
 #include<cassert>
 #define A first
 #define B second
 #define mp make_pair
 #define pb push_back
 #define pw(x) (1ll << (x))
 #define sz(x) ((int)(x).size())
 #define all(x) (x).begin(),(x).end()
 #define rep(i,l,r) for(int i=(l);i<(r);i++)
 #define per(i,r,l) for(int i=(r);i>=(l);i--)
 #define FOR(i,l,r) for(int i=(l);i<=(r);i++)
 #define eps 1e-9
 #define PIE acos(-1)
 #define cl(a,b) memset(a,b,sizeof(a))
 #define fastio ios::sync_with_stdio(false);cin.tie(0);
 #define lson l , mid , ls
 #define rson mid + 1 , r , rs
 #define ls (rt<<1)
 #define rs (ls|1)
 #define INF 0x3f3f3f3f
 #define lowbit(x) (x&(-x))
 #define sqr(a) a*a
 #define ll long long
 #define ull unsigned long long
 #define vi vector<int>
 #define pii pair<int, int>
 #define dd(x) cout << #x << " = " << (x) << ", "
 #define de(x) cout << #x << " = " << (x) << "\n"
 #define endl "\n"
 using namespace std;
 //**********************************
 const int mod=1e9;
 int n,m;
 const int maxn=;
 bool a[][];
 int dp[][maxn];
 int v[maxn];
 //**********************************
 void Init()
 {
     int tot=;
     rep(i,,<<){
 //        dd(i);de(i&i<<1);
         if((i&(i<<))==)v[tot++]=i;//注意加括号
     }
 }
 bool check(int row,int st)
 {
     FOR(i,,m){
         if((st&(<<i-))&&!a[row][i])return false;
     }
     return true;
 }
 inline int add(int a,int b){if((a+=b)>mod)a-=mod;return a;}
 //**********************************
 int main()
 {
     Init();
     while(~scanf("%d%d",&n,&m)){
         cl(dp,);
         FOR(i,,n)FOR(j,,m)scanf("%d",&a[i][j]);
         FOR(i,,n){//row
             for(int j=;v[j]<(<<m);j++){
                 if(!check(i,v[j]))continue;
                 if(i==)dp[i][j]=;
                 else {
                     for(int k=;v[k]<(<<m);k++)if((v[j]&v[k])==)dp[i][j]=add(dp[i][j],dp[i-][k]);
                 }
             }
         }

         int ans=;
         for(int i=;v[i]<(<<m);i++)ans=add(ans,dp[n][i]);
         printf("%d\n",ans);
     }
     return ;
 }

没有预处理

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<utility>
#include<functional>
#include<iomanip>
#include<sstream>
#include<ctime>
#include<cassert>
#define A first
#define B second
#define mp make_pair
#define pb push_back
#define pw(x) (1ll << (x))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define rep(i,l,r) for(int i=(l);i<(r);i++)
#define per(i,r,l) for(int i=(r);i>=(l);i--)
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define eps 1e-9
#define PIE acos(-1)
#define cl(a,b) memset(a,b,sizeof(a))
#define fastio ios::sync_with_stdio(false);cin.tie(0);
#define lson l , mid , ls
#define rson mid + 1 , r , rs
#define ls (rt<<1)
#define rs (ls|1)
#define INF 0x3f3f3f3f
#define lowbit(x) (x&(-x))
#define sqr(a) a*a
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define pii pair<int, int>
#define dd(x) cout << #x << " = " << (x) << ", "
#define de(x) cout << #x << " = " << (x) << "\n"
#define endl "\n"
using namespace std;
//**********************************
const int mod=1e9;
int n,m;
const int maxn=<<;
bool a[][];
int dp[][maxn];
int v[maxn];
//**********************************
bool check(int row,int st)
{
    if((st&(st<<)))return false;
    FOR(i,,m){
        if((st&(<<i-))&&!a[row][i])return false;
    }
    return true;
}
inline int add(int a,int b){if((a+=b)>mod)a-=mod;return a;}
//**********************************
int main()
{
    while(~scanf("%d%d",&n,&m)){
        cl(dp,);
        FOR(i,,n)FOR(j,,m)scanf("%d",&a[i][j]);
        FOR(i,,n){//row
            rep(mask,,<<m){
                if(!check(i,mask))continue;
                if(i==)dp[i][mask]=;
                else {
                    //判断与上一行的草地有没有相邻
                    rep(k,,<<m)if((mask&k)==)dp[i][mask]=add(dp[i][mask],dp[i-][k]);
                }
            }
        }
        int ans=;
        rep(mask,,<<m)ans=add(ans,dp[n][mask]);
        printf("%d\n",ans);
    }
    return ;
}