题解

#include<bits/stdc++.h>
using namespace std;
int n,m,n1,m1,d[11][11];
queue<int> q,q1;
char ch[11][11];
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
        	cin>>ch[i][j];
            if(ch[i][j]=='S'){
            	n1=i;
                m1=j;
            }
            d[i][j]=-1;
        }
    }
    q.push(n1);
    q1.push(m1);
    while(q.size()&&q1.size()){
        int r1=q.front();
        q.pop();
        int r2=q1.front();
        q1.pop();
        if(ch[r1][r2]=='T'){
            cout<<"YES";
            return 0;
        }
        if(r1+1<=n&&d[r1+1][r2]==-1&&ch[r1+1][r2]!='X'){
            d[r1+1][r2]=1;
            q.push(r1+1);
            q1.push(r2);
        }
        if(r1-1>0&&d[r1-1][r2]==-1&&ch[r1-1][r2]!='X'){
            d[r1-1][r2]=1;
            q.push(r1-1);
            q1.push(r2);
        }
        if(r2+1<=m&&d[r1][r2+1]==-1&&ch[r1][r2+1]!='X'){
            d[r1][r2+1]=1;
            q.push(r1);
            q1.push(r2+1);
        }
        if(r2-1>0&&d[r1][r2-1]==-1&&ch[r1][r2-1]!='X'){
            d[r1][r2-1]=1;
            q.push(r1);
            q1.push(r2-1);
        }
    }
    cout<<"NO";
	return 0;
}