深搜之迷宫

判断从某个点出发是否能走到终点，程序框架

#include <iostream>
#include <memory.h>
#include <string>
#include <stdio.h>
#include <queue>
#include <math.h>
#include <stdlib.h>
using namespace std;
int T;
char Map[105][105];
int N,ha,la,hb,lb;
int visited[105][105];
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
bool dfs(int i,int j)
{
    if( i==hb+1 && j==lb+1 )
        return true;
    if( visited[i][j] )
        return false;
    visited[i][j] = 1;
    for( int k = 0; k <= 3; k++ )
    {
        if( Map[i+dx[k]][j+dy[k]] != '#' && dfs(i+dx[k],j+dy[k]) )
            return true;
    }
    return false;
}
int main()
{
    cin >> T;
    while( T-- )
    {
        memset(Map,0,sizeof(Map));
        memset(visited, 0, sizeof(visited));
        cin >> N;
        for( int i = 1; i <= N; i++ )
            for( int j = 1; j <= N; j++ )
                cin >> Map[i][j];
        for( int i = 0; i <= N+1; i++ )
            for( int j = 0; j <= N+1; j++ )
                if( i==0 || j==0 || i==N+1 || j==N+1 )
                    Map[i][j] = '#';
        cin >> ha >> la >> hb >> lb;
        if( Map[ha+1][la+1] == '#' || Map[hb+1][lb+1] == '#' )
        {
            cout << "NO" << endl;
        }
        else
        {
        if( dfs(ha+1,la+1) )
            cout << "YES" << endl;
        else
            cout << "NO" << endl;
        }
    }
    return 0;
}