Sgu 132 状压dp(gtmd128)

辣鸡题卡常，改了以后又zz地把数组开成了100，debug到死都没有发现。一题做了一天多，沃日。

代码：

#include <bits/stdc++.h>
using namespace std;
const int INF=0x3f3f3f3f;
int m, n;
char str[10];
int g[80];
int dp[2][200][200];
int tofix1, tofix2;
void dfs(int line, int flor, int tar1, int tar2, int cnt)
{
    if(flor>1&&!(tofix2&(1<<(flor-2)))&&!(tar2&(1<<(flor-2)))){/*printf("sb1 %d %d %d\n",line, tar2, tofix2);*/return;}
    if(flor>2&&!(tar2&(1<<(flor-2)))&&!(tar2&(1<<(flor-3)))){/*printf("sb2 %d %d\n", line, tar2);*/return;}
    if(flor==n+1)
    {
        //printf("%d %d %d\n", tar1, tar2, line);
        dp[line%2][tar1][tar2]=min(dp[line%2][tar1][tar2], dp[(line+1)%2][tofix1][tofix2]+cnt);
        //printf("%d %d %d\n", cnt, dp[line%2][tar1][tar2], dp[(line+1)%2][tofix1][tofix2]);
        return;
    }
    dfs(line, flor+1, tar1, tar2, cnt);
    if(flor<n&&!(tar1&(1<<(flor-1)))&&!(tar1&(1<<(flor))))
        dfs(line, flor+1, tar1|(1<<(flor-1))|(1<<flor), tar2, cnt+1);
    if(!(tar1&(1<<(flor-1)))&&!(tar2&(1<<(flor-1))))
        dfs(line, flor+1, tar1|(1<<(flor-1)), tar2|(1<<(flor-1)), cnt+1);
}
int main()
{
    memset(dp, 0x3f3f3f3f, sizeof(dp));
    scanf("%d%d", &m, &n);
    for(int i=1;i<=m;i++)
    {
        g[i]=0;
        scanf("%s", str);
        for(int j=0;j<n;j++)
        {
            g[i]<<=1;
            g[i]|=(str[j]=='*');
        }
        //printf("%d\n", g[i]);
    }
    g[m+1]=(1<<n)-1;
    dp[0][(1<<n)-1][(1<<n)-1]=0;
    for(int i=1;i<=m+1;i++)
    {
        for(int j=0;j<(1<<n);j++)
            for(int k=0;k<(1<<n);k++)
            {
                if(dp[(i+1)%2][j][k]!=INF)
                {
                    tofix1=j;
                    tofix2=k;
                    //printf("%d %d %d\n", i, j, k);
                    dfs(i, 1, g[i], j, 0);
                }
            }
        memset(dp[(i+1)%2], 0x3f3f3f3f, sizeof(dp[(i+1)%2]));
    }
    int M=INF;
    for(int j=0;j<(1<<n);j++)M=min(M, dp[(m+1)%2][(1<<n)-1][j]);
    printf("%d\n", M);
}