#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
typedef pair<int, int> PII;
const int N = 205;
int t, n, m;
int dist[N][N];
char g[N][N];
int bfs(PII start, PII end)
{
queue<PII> q;
memset(dist, -1, sizeof dist);
dist[start.x][start.y] = 0;
q.push(start);
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
while(q.size())
{
PII t = q.front();
q.pop();
for(int i = 0; i < 4; i++)
{
int x = t.x + dx[i], y = t.y + dy[i];
if(x < 0 || y < 0 || x >= n || y >= m) continue;
if(g[x][y] == '#') continue;
if(dist[x][y] != -1) continue;
dist[x][y] = dist[t.x][t.y] + 1;
if(end == make_pair(x, y)) return dist[x][y];
q.push({x, y});
}
}
return -1;
}
int main()
{
cin >> t;
while(t --)
{
cin >> n >> m;
for(int i = 0; i < n; i++) scanf("%s", g[i]);
PII start, end;
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
if(g[i][j] == 'S') start = {i, j};
else if(g[i][j] == 'E') end = {i, j};
int distance = bfs(start, end);
if(distance == -1)
cout << "oop!" << endl;
else
printf("%d\n", distance);
}
return 0;
}
献给阿尔吉侬的花束
最新推荐文章于 2022-06-14 18:13:04 发布