The Morning after Halloween UVA - 1601

UVA-1601

题目：

分析：原来没看懂书上说的“把所有的空格提出来建立一张图”，于是想还是像往常一样用一个二维数组来保存地图，后来想了想实现的问题，发现十分复杂就放弃了。

        后来查了查巨佬的题解，发现使用邻接表来保存空格图。实现方法是在输入时对每一个非墙结点编号，用ID[i][j]表示(i,j)点的编号。输入完成后，遍历每一个编号结点，建立邻接表。

#include<cstdio>
#include<cmath>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<sstream>
#include<map>
#include<stack>
#include<queue>
#include<set>
using namespace std;
int m,n,all,ID[30][30];
char maps[31][31];
int x[300],y[300],start_[4],end_[4],vis[200][200][200];//vis[i][j][k]表示结点i,j,k是否已经被同时访问
int ways[5][2]={{-1,0},{1,0},{0,-1},{0,1},{0,0}};
vector<int> G[300];
struct Node{
    int d;
    int num[4];
};
int conflict(int a,int b,int aa,int bb){return aa==bb||(aa==b&&bb==a);} //重合或互换位置则冲突
int bfs(){
    Node first;
    first.d = 0;
    for(int i = 1;i<=3;i++) first.num[i] = start_[i]; //初始化起始结点
    queue<Node> begin_Q,now_Q;
    begin_Q.push(first);
    while(!begin_Q.empty()){
        Node now = begin_Q.front();begin_Q.pop();
        int a = now.num[1],b = now.num[2],c = now.num[3];
        if(a==end_[1]&&b==end_[2]&&c==end_[3]) return now.d;
        for(int i = 0;i<G[a].size();i++){
            int aa = G[a][i];
            for(int j = 0;j<G[b].size();j++){
                int bb = G[b][j];
                if(conflict(a,b,aa,bb)) continue; //判断（a,b）和 (aa,bb）是否冲突
                for(int k = 0;k<G[c].size();k++){
                    int cc = G[c][k];
                    if(conflict(a, c, aa, cc)) continue;
                    if(conflict(b, c, bb, cc)) continue;
                    if(vis[aa][bb][cc]!=-1) continue;
                    else vis[aa][bb][cc] = 1;
                    Node new_node;
                    new_node.num[1] = aa;
                    new_node.num[2] = bb;
                    new_node.num[3] = cc;
                    new_node.d = now.d + 1;
                    begin_Q.push(new_node);
                }
            }
        }
    }
    return -1;
}
int main(){
    while(scanf("%d%d%d",&n,&m,&all)==3&&m&&n&&all){
        memset(vis, -1, sizeof(vis));
        memset(start_, 0, sizeof(start_)); //保存开始结点的ID
        memset(end_, 0, sizeof(end_)); //保存结束结点的ID
        int count = 0;
        getchar();//读回车
        for(int i = 0;i<m;i++){
            gets(maps[i+1]+1);
            for(int j = 0;j<n;j++){
                if(maps[i+1][j+1]!='#'){//给非‘#’结点编号
                    count++;x[count] = i+1;y[count] = j+1;
                    G[count].clear();
                    ID[i+1][j+1] = count;
                    if(maps[i+1][j+1]>='a'&&maps[i+1][j+1]<='c') start_[maps[i+1][j+1]-'a'+1] = count;
                    if(maps[i+1][j+1]>='A'&&maps[i+1][j+1]<='C') end_[maps[i+1][j+1]-'A'+1] = count;
                }
            }
        }
        for(int i = 1;i<=count;i++){
            int sx = x[i],sy = y[i];
            for(int j = 0;j<5;j++){
                int nx = sx + ways[j][0],ny = sy + ways[j][1];
                if(nx>=1&&nx<=m&&ny>=1&&ny<=n&&maps[nx][ny]!='#'){
                    G[i].push_back(ID[nx][ny]); //建立邻接表,G[i]内的元素表示结点i所能到达的结点
                }
            }
        }
        if(all==2){//补全三个元素
            count++;G[count].clear();start_[3] = count;end_[3] = count;
            G[count].push_back(count);
        }
        if(all==1){//补全三个元素
            count++;G[count].clear();start_[3] = count;end_[3] = count;
            G[count].push_back(count);
            count++;start_[2] = count;end_[2] = count;
            G[count].push_back(count);
        }
        cout<<bfs()<<endl;
        
    }
    return 0;
}