思路:只要加传送门条件就行。
#include<iostream>
#include<algorithm>
#include<queue>
#define WF W.front()
#define XF X.front()
#define YF Y.front()
using namespace std;
int dx[4]={-1,1,0,0},dy[4]={0,0,-1,1};
int n,m,t;
int doorx[3][27],doory[3][27];
char a[101][101];
queue<int> X,Y,W;
bool in(int x,int y)
{
if(x>=1&&y>=1&&x<=n&&y<=m)return true;
return false;
}
void bfs(int x,int y,int ans)
{
if(X.empty()){cout<<"No Solution.";exit(0);}
X.pop(),Y.pop(),W.pop();
if(x==n&&y==m){cout<<ans;exit(0);}
for(int i=0;i<4;i++)
{
int nx=x+dx[i],ny=y+dy[i];
if(in(nx,ny))
{
if(a[nx][ny]>='A'&&a[nx][ny]<='Z')
{
char s=a[nx][ny];
if(doorx[1][s-64]!=nx||doory[1][s-64]!=ny)X.push(doorx[1][s-64]),Y.push(doory[1][s-64]),W.push(ans+1);
else X.push(doorx[2][s-64]),Y.push(doory[2][s-64]),W.push(ans+1);
a[nx][ny]='1';
}
else if(a[nx][ny]=='0')a[nx][ny]='1',X.push(nx),Y.push(ny),W.push(ans+1);
}
}
bfs(XF,YF,WF);
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cin>>a[i][j];
if(a[i][j]>='A'&&a[i][j]<='Z')
{
if(!doorx[1][a[i][j]-64]) doorx[1][a[i][j]-64]=i,doory[1][a[i][j]-64]=j;
else doorx[2][a[i][j]-64]=i,doory[2][a[i][j]-64]=j;
}
}
}
a[1][1]='1',X.push(1),Y.push(1),W.push(0);
bfs(1,1,0);
return 0;
}
转载于:https://www.cnblogs.com/2006hanziwei/p/10789955.html