纯搜

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e8+10;
bool flag=false;
char mp[1001][1001];
ll vis[1001][1001];
ll n,m;
ll dx[4]={1,0,-1,0};
ll dy[4]={0,1,0,-1};
void dfs(int x,int y){
for(int i=0;i<4;i++){
ll nx=dx[i]+x;
ll ny=dy[i]+y;
if(nx>0&&nx<=n&&ny>0&&ny<=m&&vis[nx][ny]0&&mp[nx][ny]!='X'){
vis[nx][ny]=1;
dfs(nx,ny);
}
if(mp[nx][ny]'T'){
flag=true;
return;
}
}
}
int main(){
cin>>n>>m;
for(ll i=1;i<=n;i++){
for(ll j=1;j<=m;j++){
cin>>mp[i][j];
}
}
for(ll i=1;i<=n;i++){
for(ll j=1;j<=m;j++){
if(mp[i][j]'S'){
dfs(i,j);
}
}
}
if(flagtrue){
cout<<"YES";
}else{
cout<<"NO";
}
return 0;
}