完全没想到是有多弱?。。。。。
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (1000+10)
long long mul(long long a,long long b){return (a*b)%F;}
long long add(long long a,long long b){return (a+b)%F;}
long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}
typedef long long ll;
int n,m,tx,ty,sx,sy;
char c[MAXN][MAXN];
bool b[MAXN][MAXN]={0};
int qx[MAXN*MAXN],qy[MAXN*MAXN],head=1,tail=1,d[MAXN][MAXN];
void bfs()
{
qx[1]=tx,qy[1]=ty;b[tx][ty]=1;
memset(d,127,sizeof(d));d[tx][ty]=0;
while (head<=tail)
{
int x=qx[head],y=qy[head];
if (1<x&&!b[x-1][y]) b[x-1][y]=1,d[x-1][y]=d[x][y]+1,qx[++tail]=x-1,qy[tail]=y;
if (x<n&&!b[x+1][y]) b[x+1][y]=1,d[x+1][y]=d[x][y]+1,qx[++tail]=x+1,qy[tail]=y;
if (1<y&&!b[x][y-1]) b[x][y-1]=1,d[x][y-1]=d[x][y]+1,qx[++tail]=x,qy[tail]=y-1;
if (y<m&&!b[x][y+1]) b[x][y+1]=1,d[x][y+1]=d[x][y]+1,qx[++tail]=x,qy[tail]=y+1;
head++;
}
}
int main()
{
//freopen("Biridian Forest.in","r",stdin);
scanf("%d%d",&n,&m);
For(i,n) scanf("%s",c[i]+1);
For(i,n) For(j,m)
if (c[i][j]=='S') sx=i,sy=j;
else if (c[i][j]=='E') tx=i,ty=j;
else if (c[i][j]=='T') b[i][j]=1;
bfs();
/*
For(i,n)
{
For(j,m) cout<<d[i][j]<<' ';cout<<endl;
}
*/
int ans=0;
For(i,n) For(j,m)
if (d[i][j]<=d[sx][sy]&&isdigit(c[i][j])) ans+=c[i][j]-48;
cout<<ans<<endl;
return 0;
}