狗の题解

#include<bits/stdc++.h>
using namespace std;
int n,m,sx,sy,ex,ey,dx[4]={-1,1,0,0},dy[4]={0,0,-1,1};
char mp[105][105];
int vis[105][105];
struct node
{
	int x;
	int y;
	int step;
};
void bfs(int x,int y)
{
	queue<node> a;
	a.push({x,y,0});
	vis[x][y]=1;
	while(!a.empty())
	{
		node now=a.front();
		a.pop();
		if(now.x==ex && now.y==ey)
		{
			cout<<now.step;
			return;
		}
		for(int i=0;i<4;i++)
		{
			int nx=now.x+dx[i];
			int ny=now.y+dy[i];
			if(nx>=0 && nx<n && ny>=0 && ny<m && vis[nx][ny]==0)
			{
				a.push({nx,ny,now.step+1});
				vis[nx][ny]=1;
			}
		}
	}
	cout<<-1;
}
int main()
{
	cin>>n>>m;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<m;j++)
		{
			cin>>mp[i][j];
			if(mp[i][j]=='S')
			{
				sx=i;
				sy=j;
			}
			else if(mp[i][j]=='T')
			{
				ex=i;
				ey=j;
			}
			else if(mp[i][j]=='#')
			{
				vis[i][j]=1;
			}
			else
			{
				vis[i][j]=0;	
			} 
		}
	}
	bfs(sx,sy);
	return 0;	
}