light oj 1057 状压dp TSP

 #include <iostream>
 #include <cstdlib>
 #include <cstring>
 #include <queue>
 #include <cstdio>
 #include <algorithm>
 #include <map>
 //#include <time.h>
 //#include <ext/pb_ds/assoc_container.hpp>
 //#include <ext/pb_ds/tree_policy.hpp>
 #define LL long long

 using namespace std;
 //using namespace __gnu_pbds;

 int dp[<<][];

 int n;

 struct nodes
 {
     int x, y;
     int operator - (const nodes &b)const
     {
         return max(abs(x - b.x) , abs(y - b.y));
     }
 }Point[];

 int dfs(int statu,int cur)
 {
     if(dp[statu][cur] != -)
         return dp[statu][cur];
     if(statu == (<< (n+) )- && cur == )
         return dp[statu][cur] = ;
     dp[statu][cur] = 0x3f3f3f;

     for(int i = ; i <= n; i++)
     {
         if( ((statu >> i)&) ==  ) continue;
         dp[statu][cur] = min(dp[statu][cur], dfs( statu|(<<i),i ) + (Point[cur]-Point[i]) );
     }

     return dp[statu][cur];
 }

 void solve()
 {
     memset(dp,-,sizeof(dp));
     int row,col;
     scanf("%d %d",&row,&col);
     char ss[];
     n = ;
     for(int i = ; i <= row; i++)
     {
         scanf("%s",ss+);
         for(int j = ; j <= col; j++)
             if(ss[j] == 'x')
         {
             Point[].x = i;
             Point[].y = j;
         }
         else if(ss[j] == 'g')
         {
             Point[++n].x = i;
             Point[n].y = j;
         }
     }
     int ans = dfs(,);
     printf("%d\n",ans);
 }

 int main(void)
 {
     int t,cnt = ;
     scanf("%d",&t);
     while(t--)
     {
         printf("Case %d: ",++cnt);
         solve();
     }
     return ;
 }