POJ2688 Cleaning Robot(BFS+TSP问题)

机器人需要打扫在地图上不同位置的垃圾，地图上有的位置是墙无法经过。问打扫完所有垃圾的最少步数（不用回到起点）。
先用BFS求出垃圾们和起点两两之间的距离，再用一个DFS搜出最优解(类似于状压DP)

#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
struct Node
{
    int x,y,stp;
    Node(){}
    Node(int a,int b,int c)
    {x = a; y = b; stp = c;}
}st,ed[20];
int n,m,p,ans;
char mp[23][23];
int g[11][11];
int dir[4][2] = {{-1,0},{1,0},{0,-1},{0,1}};
bool vis[21][21],f[15];
bool inarea(int i,int j)
{
    if(i < 1||j < 1||i > n||j > m) return false;
    else return true;
}
void Init()
{
    memset(mp,0,sizeof mp);
    memset(ed,0,sizeof ed);
    p = st.x = st.y = st.stp = 0;
    memset(g,0,sizeof g);
    memset(f,0,sizeof f);
    ans = 0x3f3f3f3f;
    f[0] = 1;
}
int bfs(Node s,Node t)
{
    memset(vis,0,sizeof vis);
    queue<Node> Q;
    s.stp = 0;
    Q.push(s);
    vis[s.x][s.y] = 1;
    while(!Q.empty())
    {
        Node u = Q.front();
        Q.pop();
        for(int i = 0; i < 4; i++)
        {
            int tx = u.x+dir[i][0],ty = u.y+dir[i][1];
            if(vis[tx][ty]||!inarea(tx,ty)||mp[tx][ty] == 'x') continue;
            if(tx == t.x&&ty == t.y)
            {
                return u.stp+1;
            }
            vis[tx][ty] = 1;
            Q.push(Node(tx,ty,u.stp+1));
        }
    }
    return -1;
}
void dfs(int t,int num,int nowlen)
{
    if(num >= p)
    {
        if(nowlen <= ans) ans = nowlen;
        return;
    }
    if(nowlen >= ans) return;
    for(int i = 0; i <= p; i++)
    {
        if(i == t||f[i]) continue;
        f[i] = 1;
        dfs(i,num+1,g[t][i]+nowlen);
        f[i] = 0;
    }
}
int main()
{
    while(scanf("%d%d",&m,&n) != EOF&&n+m)
    {
        Init();
        for(int i = 1; i <= n; i++)
        {   
            scanf("%s",mp[i]+1);
            for(int j = 1; j <= m; j++)
            {   
                if(mp[i][j] == 'o') st.x = i,st.y = j;
                if(mp[i][j] == '*') ed[++p].x = i,ed[p].y = j;
            }
        }
        ed[0].x = st.x,ed[0].y = st.y;
        bool flag = 0;
        for(int i = 0; i < p; i++)
            for(int j = i+1; j <= p; j++)
            {
                int t = bfs(ed[i],ed[j]);
                if(t == -1) {flag = 1; break;}
                g[i][j] = t;
                g[j][i] = t;
            }
        if(flag)
        {
            printf("-1\n");
            continue;
        }
        dfs(0,0,0);
        printf("%d\n",ans);
    }
}