#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
using namespace std;
int n,m;
char map[101][101];
int v[101][101];
struct node
{
int ans,x,y;
};
struct node t,f;
int tx,ty,maxx,maxy;
int fx[]= {1,-1,0,0};
int fy[]= {0,0,1,-1};
void bfs()
{
queue<node>q;
memset(v,0,sizeof(v));
t.x=tx;
t.y=ty;
t.ans=1;
q.push(t);
v[t.x][t.y]=1;
while(!q.empty())
{
t=q.front();
q.pop();
if(map[t.x][t.y]=='E')
{
printf("%d\n",t.ans);
return ;
}
for(int i=0; i<4; i++)
{
f.x=t.x+fx[i];
f.y=t.y+fy[i];
if(f.x>=0&&f.x<n&&f.y>=0&&f.y<m&&v[f.x][f.y]==0&&map[f.x][f.y]!='#')
{
f.ans=t.ans+1;
v[f.x][f.y]=1;
q.push(f);
}
}
}
}
void dfs1(int xx,int yy,int d,int ans)//向左转
{
if(map[xx][yy]=='E')
{
maxx=ans;
return ;
}
if(d==0)//0是下1是上2是右3是左
{
if(xx>=0&&xx<n&&yy+1>=0&&yy+1<m&&map[xx][yy+1]!='#')
{
dfs1(xx,yy+1,2,ans+1);
}
else if(xx+1>=0&&xx+1<n&&yy>=0&&yy<m&&map[xx+1][yy]!='#')
{
dfs1(xx+1,yy,0,ans+1);
}
else if(xx>=0&&xx<n&&yy-1>=0&&yy-1<m&&map[xx][yy-1]!='#')
{
dfs1(xx,yy-1,3,ans+1);
}
else if(xx-1>=0&&xx-1<n&&yy>=0&&yy<m&&map[xx-1][yy]!='#')
{
dfs1(xx-1,yy,1,ans+1);
}
}
else if(d==1)
{
if(xx>=0&&xx<n&&yy-1>=0&&yy-1<m&&map[xx][yy-1]!='#')
{
dfs1(xx,yy-1,3,ans+1);
}
else if(xx-1>=0&&xx-1<n&&yy>=0&&yy<m&&map[xx-1][yy]!='#')
{
dfs1(xx-1,yy,1,ans+1);
}
else if(xx>=0&&xx<n&&yy+1>=0&&yy+1<m&&map[xx][yy+1]!='#')
{
dfs1(xx,yy+1,2,ans+1);
}
else if(xx+1>=0&&xx+1<n&&yy>=0&&yy<m&&map[xx+1][yy]!='#')
{
dfs1(xx+1,yy,0,ans+1);
}
}
else if(d==2)
{
if(xx-1>=0&&xx-1<n&&yy>=0&&yy<m&&map[xx-1][yy]!='#')
{
dfs1(xx-1,yy,1,ans+1);
}
else if(xx>=0&&xx<n&&yy+1>=0&&yy+1<m&&map[xx][yy+1]!='#')
{
dfs1(xx,yy+1,2,ans+1);
}
else if(xx+1>=0&&xx+1<n&&yy>=0&&yy<m&&map[xx+1][yy]!='#')
{
dfs1(xx+1,yy,0,ans+1);
}
else if(xx>=0&&xx<n&&yy-1>=0&&yy-1<m&&map[xx][yy-1]!='#')
{
dfs1(xx,yy-1,3,ans+1);
}
}
else if(d==3)
{
if(xx+1>=0&&xx+1<n&&yy>=0&&yy<m&&map[xx+1][yy]!='#')
{
dfs1(xx+1,yy,0,ans+1);
}
else if(xx>=0&&xx<n&&yy-1>=0&&yy-1<m&&map[xx][yy-1]!='#')
{
dfs1(xx,yy-1,3,ans+1);
}
else if(xx-1>=0&&xx-1<n&&yy>=0&&yy<m&&map[xx-1][yy]!='#')
{
dfs1(xx-1,yy,1,ans+1);
}
else if(xx>=0&&xx<n&&yy+1>=0&&yy+1<m&&map[xx][yy+1]!='#')
{
dfs1(xx,yy+1,2,ans+1);
}
}
return ;
}
void dfs2(int xx,int yy,int d,int ans)//向右转
{
if(map[xx][yy]=='E')
{
maxy=ans;
return ;
}
if(d==0)//0是下1是上2是右3是左
{
if(xx>=0&&xx<n&&yy-1>=0&&yy-1<m&&map[xx][yy-1]!='#')
{
dfs2(xx,yy-1,3,ans+1);
}
else if(xx+1>=0&&xx+1<n&&yy>=0&&yy<m&&map[xx+1][yy]!='#')
{
dfs2(xx+1,yy,0,ans+1);
}
else if(xx>=0&&xx<n&&yy+1>=0&&yy+1<m&&map[xx][yy+1]!='#')
{
dfs2(xx,yy+1,2,ans+1);
}
else if(xx-1>=0&&xx-1<n&&yy>=0&&yy<m&&map[xx-1][yy]!='#')
{
dfs2(xx-1,yy,1,ans+1);
}
}
else if(d==1)
{
if(xx>=0&&xx<n&&yy+1>=0&&yy+1<m&&map[xx][yy+1]!='#')
{
dfs2(xx,yy+1,2,ans+1);
}
else if(xx-1>=0&&xx-1<n&&yy>=0&&yy<m&&map[xx-1][yy]!='#')
{
dfs2(xx-1,yy,1,ans+1);
}
else if(xx>=0&&xx<n&&yy-1>=0&&yy-1<m&&map[xx][yy-1]!='#')
{
dfs2(xx,yy-1,3,ans+1);
}
else if(xx+1>=0&&xx+1<n&&yy>=0&&yy<m&&map[xx+1][yy]!='#')
{
dfs2(xx+1,yy,0,ans+1);
}
}
else if(d==2)
{
if(xx+1>=0&&xx+1<n&&yy>=0&&yy<m&&map[xx+1][yy]!='#')
{
dfs2(xx+1,yy,0,ans+1);
}
else if(xx>=0&&xx<n&&yy+1>=0&&yy+1<m&&map[xx][yy+1]!='#')
{
dfs2(xx,yy+1,2,ans+1);
}
else if(xx-1>=0&&xx-1<n&&yy>=0&&yy<m&&map[xx-1][yy]!='#')
{
dfs2(xx-1,yy,1,ans+1);
}
else if(xx>=0&&xx<n&&yy-1>=0&&yy-1<m&&map[xx][yy-1]!='#')
{
dfs2(xx,yy-1,3,ans+1);
}
}
else if(d==3)
{
if(xx-1>=0&&xx-1<n&&yy>=0&&yy<m&&map[xx-1][yy]!='#')
{
dfs2(xx-1,yy,1,ans+1);
}
else if(xx>=0&&xx<n&&yy-1>=0&&yy-1<m&&map[xx][yy-1]!='#')
{
dfs2(xx,yy-1,3,ans+1);
}
else if(xx+1>=0&&xx+1<n&&yy>=0&&yy<m&&map[xx+1][yy]!='#')
{
dfs2(xx+1,yy,0,ans+1);
}
else if(xx>=0&&xx<n&&yy+1>=0&&yy+1<m&&map[xx][yy+1]!='#')
{
dfs2(xx,yy+1,2,ans+1);
}
}
return ;
}
int main()
{
int T,j;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&m,&n);
for(int i=0; i<n; i++)
{
scanf("%*c%s",map[i]);
}
for(int i=0; i<n; i++)
{
for(j=0; j<m; j++)
{
if(map[i][j]=='S')
{
tx=i;
ty=j;
if(i==0)//开始方向向下
{
dfs1(tx+1,ty,0,2);
dfs2(tx+1,ty,0,2);
}
else if(i==n-1)//开始方向向上
{
dfs1(tx-1,ty,1,2);
dfs2(tx-1,ty,1,2);
}
else if(j==0)//开始方向向右
{
dfs1(tx,ty+1,2,2);
dfs2(tx,ty+1,2,2);
}
else if(j==m-1)//开始方向向左
{
dfs1(tx,ty-1,3,2);
dfs2(tx,ty-1,3,2);
}
break;
}
}
if(j!=m) break;
}
printf("%d %d ",maxx,maxy);
bfs();
}
return 0;
}
- 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.
- 67.
- 68.
- 69.
- 70.
- 71.
- 72.
- 73.
- 74.
- 75.
- 76.
- 77.
- 78.
- 79.
- 80.
- 81.
- 82.
- 83.
- 84.
- 85.
- 86.
- 87.
- 88.
- 89.
- 90.
- 91.
- 92.
- 93.
- 94.
- 95.
- 96.
- 97.
- 98.
- 99.
- 100.
- 101.
- 102.
- 103.
- 104.
- 105.
- 106.
- 107.
- 108.
- 109.
- 110.
- 111.
- 112.
- 113.
- 114.
- 115.
- 116.
- 117.
- 118.
- 119.
- 120.
- 121.
- 122.
- 123.
- 124.
- 125.
- 126.
- 127.
- 128.
- 129.
- 130.
- 131.
- 132.
- 133.
- 134.
- 135.
- 136.
- 137.
- 138.
- 139.
- 140.
- 141.
- 142.
- 143.
- 144.
- 145.
- 146.
- 147.
- 148.
- 149.
- 150.
- 151.
- 152.
- 153.
- 154.
- 155.
- 156.
- 157.
- 158.
- 159.
- 160.
- 161.
- 162.
- 163.
- 164.
- 165.
- 166.
- 167.
- 168.
- 169.
- 170.
- 171.
- 172.
- 173.
- 174.
- 175.
- 176.
- 177.
- 178.
- 179.
- 180.
- 181.
- 182.
- 183.
- 184.
- 185.
- 186.
- 187.
- 188.
- 189.
- 190.
- 191.
- 192.
- 193.
- 194.
- 195.
- 196.
- 197.
- 198.
- 199.
- 200.
- 201.
- 202.
- 203.
- 204.
- 205.
- 206.
- 207.
- 208.
- 209.
- 210.
- 211.
- 212.
- 213.
- 214.
- 215.
- 216.
- 217.
- 218.
- 219.
- 220.
- 221.
- 222.
- 223.
- 224.
- 225.
- 226.
- 227.
- 228.
- 229.
- 230.
- 231.
- 232.
- 233.
- 234.
- 235.
- 236.
- 237.
- 238.
- 239.
- 240.
- 241.
- 242.
- 243.
- 244.
- 245.
- 246.
- 247.
- 248.
- 249.
- 250.
- 251.
- 252.
- 253.
- 254.
- 255.
- 256.
- 257.
- 258.
- 259.
- 260.
- 261.
- 262.
- 263.
- 264.
- 265.
- 266.
- 267.