AI别看

AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看AI别看

#include<bits/stdc++.h>
using namespace std;
int n,m;
char mp[15][15];
bool visit[15][15];
int dy[4] = {0,0,-1,1},dx[4] = {-1,1,0,0};
bool found = false;
void dfs(int x,int y){
    if(found)return;
    if(x < 1 || x > n || y < 1 || y > m)return;
    if(mp[x][y] == 'X')return;
    if(visit[x][y])return;
    visit[x][y] = true;
    if(mp[x][y] == 'T'){
        cout << "YES";
        found = true;
        return;
    }
    for(int i = 0;i <= 3;i++){
        int nx = x + dx[i];
        int ny = y + dy[i];
        dfs(nx,ny);
    }
}
int main(){
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
        for(int j = 1;j <= m;j++)
            cin >> mp[i][j];
    dfs(1,1);
    if(!found)
        cout << "NO";
    return 0;
}