分析:传送门直接相连然后直接bfs就好。
#include<cstdio>
#include<cstring>
#include<algorithm>
//#include<cmath>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long ll;
const int N=505;
const int dx[4]={0,1,0,-1};
const int dy[4]={1,0,-1,0};
struct node
{
int x1,y1,x2,y2;
}go[50];
int n,m;
int x1,y1,x2,y2;
int gox[N][N],goy[N][N];
int dist[N][N];
int send[N][N];
int bz[N][N];
struct data
{
int x,y;
}q[N*N];
inline void bfs()
{
memset(dist,-1,sizeof(dist));
q[1].x=x1;
q[1].y=y1;
bz[x1][y1]=1;
dist[x1][y1]=0;
int t=0,w=1;
while(t<w)
{
data now=q[++t];
if (now.x==x2&&now.y==y2)return;
fo(k,0,3)
{
int ex=now.x+dx[k];
int ey=now.y+dy[k];
if (send[ex][ey])
{
int xx=ex,yy=ey;
ex=gox[xx][yy];
ey=goy[xx][yy];
}
if (ex<1||ex>n||ey<1||ey>m||bz[ex][ey])continue;
bz[ex][ey]=1;
dist[ex][ey]=dist[now.x][now.y]+1;
q[++w].x=ex;
q[w].y=ey;
}
}
}
int main()
{
scanf("%d%d",&n,&m);
fo(i,1,n)
fo(j,1,m)
{
char ch=getchar();
while (ch!='#'&&ch!='='&&ch!='.'&&ch!='@'&&(ch<'A'||ch>'Z'))ch=getchar();
if (ch=='@')
{
x1=i,y1=j;
}
else
if (ch=='#')bz[i][j]=1;
else
if (ch=='=')x2=i,y2=j;
else
if (ch>='A'&&ch<='Z')
{
int cnt=ch-'A'+1;
send[i][j]=1;
if (!go[cnt].x1)
{
go[cnt].x1=i;
go[cnt].y1=j;
}
else
{
go[cnt].x2=i;
go[cnt].y2=j;
}
}
}
fo(i,1,26)
if (go[i].x1)
{
int x1=go[i].x1;
int y1=go[i].y1;
int x2=go[i].x2;
int y2=go[i].y2;
gox[x1][y1]=x2;
goy[x1][y1]=y2;
gox[x2][y2]=x1;
goy[x2][y2]=y1;
}
bfs();
printf("%d\n",dist[x2][y2]);
}