uva1601 迷宫状态存储，

这道题显然很经典。。。

自己还是要照着刘汝佳的代码背下这种形式。。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<string>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<stack>
#include<cmath>
#include<map>
#include<vector>
#define ll long long
#define inf 0x3f3f3f3f
#define INF 1000000000
#define bug1 cout<<"bug1"<<endl;
#define bug2 cout<<"bug2"<<endl;
#define bug3 cout<<"bug3"<<endl;
using namespace std;
const int maxn=260;
int x[maxn],y[maxn],id[20][20];
int s[3],t[3];
int deg[maxn];
int G[maxn][5];
int d[maxn][maxn][maxn];
char maze[20][20];
const int dx[]={1,-1,0,0,0}; // 4 moves, plus "no move"
const int dy[]={0,0,1,-1,0};
inline bool conflict(int a,int b,int a2,int b2){
    return a2==b2||(a==b2&&b==a2);
}
inline int ID(int a,int b,int c){
    return (a<<16)|(b<<8)|c;
}
int bfs(){
    memset(d,-1,sizeof(d));
    queue<int>q;
    q.push(ID(s[0],s[1],s[2]));
    d[s[0]][s[1]][s[2]]=0;
    while(!q.empty()){
        int u=q.front();q.pop();
        int a=(u>>16)&0xff,b=(u>>8)&0xff,c=u&0xff;
        if(a==t[0]&&b==t[1]&&c==t[2])return d[a][b][c];
        for(int i=0;i<deg[a];++i){
            int a2=G[a][i];
            for(int j=0;j<deg[b];++j){
                int b2=G[b][j];
                if(conflict(a,b,a2,b2))continue;
                for(int k=0;k<deg[c];++k){
                    int c2=G[c][k];
                    if(conflict(a,c,a2,c2))continue;
                    if(conflict(b,c,b2,c2))continue;
                    if(d[a2][b2][c2]!=-1)continue;
                    d[a2][b2][c2]=d[a][b][c]+1;
                    q.push(ID(a2,b2,c2));
                }
            }
        }
    }
    return -1;
}
int main(){
    int h,w,n;
    while(scanf("%d%d%d\n",&w,&h,&n)==3&&n){
        for(int i = 1; i <=h; i++)
            fgets(maze[i], 20, stdin);
        int cnt=0;
        for(int i=1;i<=h;++i){
            for(int j=1;j<=w;++j){
                if(maze[i][j]=='#')continue;
                x[cnt]=i;y[cnt]=j;id[i][j]=cnt;
                if(islower(maze[i][j])){s[maze[i][j]-'a']=cnt;}
                if(isupper(maze[i][j])){t[maze[i][j]-'A']=cnt;}
                cnt++;
            }
        }
        for(int i=0;i<cnt;++i){
            deg[i]=0;
            for(int dir=0;dir<5;++dir){
                int nx=x[i]+dx[dir],ny=y[i]+dy[dir];
                if(maze[nx][ny] != '#') G[i][deg[i]++] = id[nx][ny];
            }
        }
        if(n<=2){deg[cnt]=1;G[cnt][0]=cnt;s[2]=t[2]=cnt++;}
        if(n<=1){deg[cnt]=1;G[cnt][0]=cnt;s[1]=t[1]=cnt++;}
        printf("%d\n",bfs());

    }
}