hdu1693Eat the Trees（插头dp）

传送门

先坑着，等啥时候会了再来填坑

不得不说思路真的是很妙啊

 //minamoto
 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #define ll long long
 using namespace std;
 #define getc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
 char buf[<<],*p1=buf,*p2=buf;
 inline int read(){
     #define num ch-'0'
     char ch;bool flag=;int res;
     while(!isdigit(ch=getc()))
     (ch=='-')&&(flag=true);
     for(res=num;isdigit(ch=getc());res=res*+num);
     (flag)&&(res=-res);
     #undef num
     return res;
 }
 const int N=;
 int n,m,bin[N],mp[N][N];
 ll f[N][N][(<<)+];
 void solve(int x,int y){
     int plug1=bin[y-],plug2=bin[y];
     if(mp[x][y]){
         for(int j=;j<bin[m+];++j){
             f[x][y][j]+=f[x][y-][j^plug1^plug2];
             if(((j>>(y-))&)==((j>>y)&)) continue;
             f[x][y][j]+=f[x][y-][j];
         }
     }
     else{
         for(int j=;j<bin[m+];++j){
             if(!(j&plug1)&&!(j&plug2)) f[x][y][j]=f[x][y-][j];
             else f[x][y][j]=;
         }
     }
 }
 int main(){
 //    freopen("testdata.in","r",stdin);
     int T=read();
     bin[]=;for(int i=;i<=;++i) bin[i]=bin[i-]<<;
     for(int t=;t<=T;++t){
         n=read(),m=read();
         for(int i=;i<=n;++i)
         for(int j=;j<=m;++j)
         mp[i][j]=read();
         memset(f,,sizeof(f));
         f[][][]=;
         for(int i=;i<=n;++i){
             for(int j=;j<=m;++j) solve(i,j);
             if(i!=n) for(int j=;j<bin[m];++j)
                     f[i+][][j<<]=f[i][m][j];
         }
         printf("Case %d: There are %lld ways to eat the trees.\n",t,f[n][m][]);
     }
     return ;
 }