#include<bits/stdc++.h>
using namespace std;
struct point
{
	int x,y,dsap,fst,step;
};
queue<point> q;
int n,m,pl[351][351],t[351][351],s[351][351],vis[351][351][16][16];
const int dx[8]={1,0,-1,0,1,-1,-1,1},dy[8]={0,1,0,-1,1,1,-1,-1};
void la(int x,int y,int k)
{
	for(int i=0;i<=k;i++)
	{
		t[max(x-i,1)][max(y-(k-i),1)]++;
		t[max(x-i,1)][min(y+(k-i),m)+1]--;
		t[min(x+i,n)][max(y-(k-i),1)]++;
		t[min(x+i,n)][min(y+(k-i),m)+1]--;
	}
}
point minway(point a,point b)
{
	if(a.step!=b.step)return a.step<b.step?a:b;
	if(a.dsap+a.fst!=b.dsap+b.fst)return a.dsap+a.fst<b.dsap+b.fst?a:b;
	return a.dsap<b.dsap?a:b;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int c1,c2,d,sx,sy,ex,ey;
	point ans=(point){0,0,0x3f3f3f3f,0x3f3f3f3f,0x3f3f3f3f};
	string k;
	cin>>n>>m>>c1>>c2>>d;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<m;j++)
		{
			cin>>k;
			if(k=="S")
			{
				sx=i;
				sy=j;
				pl[i][j]=-1;
			}
			else if(k=="T")
			{
				ex=i;
				ey=j;
				pl[i][j]=-2;
			}
			else if(k==".")pl[i][j]=0;
			else
			{
				for(int i=0;i<k.size();i++)
				{
					pl[i][j]*=10;
					pl[i][j]+=k[i];
					pl[i][j]-='0';
					la(i,j,pl[i][j]-1);
				}
			}
		}
	}
	int sum;
	for(int i=0;i<n;i++)
	{
		sum=0;
		for(int j=0;j<m;j++)
		{
			sum+=t[i][j];
			if(sum>0)s[i][j]=1;
		}
	}
	q.push((point){sx,sy,0,0,0});
	point fro;
	while(!q.empty())
	{
		fro=q.front();
		q.pop();
		if(fro.step>ans.step)continue;
		if(fro.x==ex&&fro.y==ey)
		{
			ans=minway(ans,fro);
			continue;
		}
		for(int i=0;i<8;i++)
		{
			int nx=fro.x+dx[i];
			int ny=fro.y+dy[i];
			if(nx<0||nx>=n||ny<0||ny>=m||pl[nx][ny]>0)continue;
			if(s[nx][ny])
			{
				if(vis[nx][ny][fro.dsap+1][fro.fst]||fro.dsap+1>c1)continue;
				vis[nx][ny][fro.dsap+1][fro.fst]=1;
				q.push((point){nx,ny,fro.dsap+1,fro.fst,fro.step+1});
			}
			else
			{
				if(vis[nx][ny][fro.dsap][fro.fst])continue;
				vis[nx][ny][fro.dsap][fro.fst]=1;
				q.push((point){nx,ny,fro.dsap,fro.fst,fro.step+1});
			}
		}
		if(fro.fst+1>c2)continue;
		for(int i=0;i<4;i++)
		{
			int nx=fro.x+dx[i]*d;
			int ny=fro.y+dy[i]*d;
			if(nx<0||nx>=n||ny<0||ny>=m||pl[nx][ny]>0)continue;
			if(s[nx][ny])
			{
				if(vis[nx][ny][fro.dsap+1][fro.fst+1]||fro.dsap+1>c1)continue;
				vis[nx][ny][fro.dsap+1][fro.fst+1]=1;
				q.push((point){nx,ny,fro.dsap+1,fro.fst+1,fro.step+1});
			}
			else
			{
				if(vis[nx][ny][fro.dsap][fro.fst+1])continue;
				vis[nx][ny][fro.dsap][fro.fst+1]=1;
				q.push((point){nx,ny,fro.dsap,fro.fst+1,fro.step+1});
			}
		}
	}
	if(ans.step==0x3f3f3f3f)cout<<-1;
	else cout<<ans.step<<' '<<ans.dsap<<' '<<ans.fst;
	return 0;
}

思路完全是第一篇题解的思路，但样例#1都过不了

调了一个月了