hdu1693Eat the Trees

链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=1693

题意：给定一个n*m的矩阵，每个格子要么是树要么是空地。每次选择一个环（环上全是树）然后删除这些树，直到删完全部的树。求方案数。

分析：基础的插头dp。只要标记每个位置是否有插头即可。

代码：

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=15;
const int mod=1000000007;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
const ll MAX=1ll<<55;
const double eps=1e-5;
const double inf=~0u>>1;
const double pi=acos(-1.0);
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
int a[N][N],e[1<<N];
ll dp[2][1<<N];
int main()
{
    int i,j,k,n,m,t,ca,pre,now,T,L,U;
    scanf("%d", &t);
    for (i=0;i<N;i++) e[i]=1<<i;
    for (ca=1;ca<=t;ca++) {
        scanf("%d%d", &n, &m);
        for (i=1;i<=n;i++)
            for (j=1;j<=m;j++) scanf("%d", &a[i][j]);
        memset(dp,0,sizeof(dp));
        pre=now=0;dp[0][0]=1;T=1<<m+1;
        for (i=1;i<=n;i++) {
            pre=now;now^=1;
            memset(dp[now],0,sizeof(dp[now]));
            for (k=0;k<T;k++)
            if (~k&T) dp[now][k<<1]+=dp[pre][k];
            for (j=1;j<=m;j++) {
                pre=now;now^=1;
                memset(dp[now],0,sizeof(dp[now]));
                if (a[i][j]) {
                    for (k=0;k<T;k++) {
                        L=k&e[j-1];U=k&e[j];
                        if (L&&U) dp[now][k-e[j-1]-e[j]]+=dp[pre][k];
                        else if (L&&!U) {
                            dp[now][k]+=dp[pre][k];
                            dp[now][k-e[j-1]+e[j]]+=dp[pre][k];
                        } else if (!L&&U) {
                            dp[now][k]+=dp[pre][k];
                            dp[now][k+e[j-1]-e[j]]+=dp[pre][k];
                        } else dp[now][k+e[j-1]+e[j]]+=dp[pre][k];
                    }
                } else {
                    for (k=0;k<T;k++)
                    if (~k&e[j-1]&&~k&e[j]) dp[now][k]+=dp[pre][k];
                }
            }
        }
        printf("Case %d: There are %lld ways to eat the trees.\n", ca, dp[now][0]);
    }
    return 0;
}