AcWing 1112. 迷宫
原题链接
简单
作者:
我是java同学
,
2023-02-06 08:38:07
,
所有人可见
,
阅读 125
dfs
#include <iostream>
#include <cstring>
using namespace std;
const int N = 110;
int n;
char g[N][N];
bool st[N][N];
int xa, ya, xb, yb;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
bool dfs(int x, int y)
{
if (g[x][y] == '#') return false;
if (x == xb && y == yb) return true;
st[x][y] = true;
for (int i = 0; i < 4; i ++ )
{
int a = x + dx[i], b = y + dy[i];
if (a < 0 || a >= n || b < 0 || b >= n) continue;
if (g[a][b] == '#') continue;
if (st[a][b]) continue;
if (dfs(a, b)) return true;
}
return false;
}
int main()
{
int T;
cin >> T;
while (T -- )
{
cin >> n;
for (int i = 0; i < n; i ++ ) cin >> g[i];
cin >> xa >> ya >> xb >> yb;
memset(st, false, sizeof st);
if (dfs(xa, ya)) puts("YES");
else puts("NO");
}
return 0;
}