2012杭州站B - Stealing Harry Potter's Precious（搜索+下一排列）

题目地址

题目大意：给出一个n*m的字符数组，'@'表示起点，'.'表示可以走，'#'表示不能走，再给出p个点的坐标，若p(p<=4)个点都能到达输出最小的步数，只需要从起点走一次，不能全到达输出-1

解题思路：先搜索求出任意2个需要到达点之间的最少步数（包括起点），再用下一排列找路径并求其步数，比较选择最小步数即可

#include <bits/stdc++.h>

using namespace std;

const int maxn = 100+10;
const int INF = 1000000000;

typedef pair<int,int> P;
char s[maxn][maxn];
int n,m;
int d[maxn][maxn],mp[maxn][maxn];

struct Point
{
    int x,y;
}pp[maxn];

int dx[4] = {1,0,-1,0},dy[4] = {0,1,0,-1};

int bfs(int sx,int sy,int gx,int gy)
{
    queue<P> q;
    for(int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
            d[i][j] = INF;
    q.push(P(sx,sy));
    d[sx][sy] = 0;
    while(q.size())
    {
        P p = q.front();q.pop();
        if(p.first == gx && p.second == gy) break;
        for(int i = 0; i < 4; i++)
        {
            int nx = p.first+dx[i],ny = p.second+dy[i];
            if(0<=nx && nx<n && 0<=ny && ny<m && s[nx][ny]!='#'&& d[nx][ny]==INF)
            {
                q.push(P(nx,ny));
                d[nx][ny] = d[p.first][p.second]+1;
            }
        }
    }
    return d[gx][gy];
}
int main()
{
    while(scanf("%d%d",&n,&m) != EOF)
    {
        if(!(n+m))  break;
        for(int i = 0; i < n; i++)
        {
            getchar();
            for(int j = 0; j < m; j++)
            {
                scanf("%c",&s[i][j]);
                if(s[i][j] == '@')
                pp[0].x = i,pp[0].y= j;
            }
        }
        int c[maxn]={0,0,0,0,0,0};
        int k;
        scanf("%d",&k);
        for(int i = 1; i <= k; i++)
        {
            scanf("%d%d",&pp[i].x,&pp[i].y);
            pp[i].x-=1,pp[i].y-=1;
            c[i] = i;
        }
        k++;
        memset(mp,0,sizeof(mp));
        for(int i = 0; i < k; i++)
        for(int j = 0; j < k; j++)
        mp[i][j] = bfs(pp[i].x,pp[i].y,pp[j].x,pp[j].y);

        int minn = INF;
        int ans = 0;
        do
        {
            ans = mp[0][c[1]];
            for(int i=1;i<k-1;i++)
                ans += mp[c[i]][c[i+1]];
            minn = min(minn,ans);
        }while(next_permutation(c+1,c+k));
        if(minn==INF)printf("-1\n");
        else printf("%d\n",minn);
    }
    return 0;
}