1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66#include <bits/stdc++.h>
using namespace std;

int n,m;
char maze[200][200];
bool vis[200][200];
int fx[][2] = { 1,0, -1,0, 0,1, 0,-1 };

int sx,sy,tx,ty;
struct pos {
    int x,y,step;
};


void init(){
    memset(vis,0,sizeof(vis));
    int i,j;
    scanf("%d%d",&n,&m);
    for (i=1;i<=n;i++){
        scanf("%s",maze[i]+1);
        for (j=1;j<=m;j++){
            if( maze[i][j] == 'S')
                sx = i, sy = j;
            else if( maze[i][j] == 'T')
                tx = i, ty = j;
        }
    }
}
bool inmap(int x,int y){
    if( x >=1 && y>=1 && x <=n & y<=m)
        return 1;
    return 0;
}


int bfs(){
    queue<pos> q;
    q.push({sx,sy,0});
    vis[sx][sy] = 1;

    while( !q.empty()){
        pos h = q.front();q.pop();

        int i;
        for (i=0;i<4;i++){
            int nx = h.x+fx[i][0];
            int ny = h.y+fx[i][1];
            if( maze[nx][ny] == 'T'){
                return h.step+1;
            }

            if( inmap(nx, ny) && !vis[nx][ny] && maze[nx][ny] == '.'){
                vis[nx][ny] = 1;
                q.push({nx,ny,h.step+1});
            }
        }
    }

    return -1;
}
int main(){
    init();
    int ans = bfs();
    printf("%d\n",ans);
    return 0;
}