迷宫

#include<iostream>
#include<stdio.h>
#include<cmath>
#include<string.h>
//#include<map>
#include<queue>
#include<algorithm>
using namespace std;
int map[20][20]={0};
int n;
bool flag=false;
void dfs(int x,int y)
{
if (x==n-1&&y==n-1)
{
/* code */
flag=true;
}else
{
if (x>=n||y>=n||x<0||y<0||!map[x][y])
{
}else
{
map[x][y]=0;
dfs(x+1,y);
dfs(x-1,y);
dfs(x,y+1);
dfs(x,y-1);
}
}
}
int main()
{
int cishu;
cin>>cishu;
for (int i = 0; i < cishu; ++i)
{
/* code */
flag=false;
cin>>n;
string tempstring;
for (int j = 0; j < n; ++j)
{
/* code */
cin>>tempstring;
for (int k = 0; k < n; ++k)
{
/* code */
if (tempstring[k]=='#')
{
/* code */
map[j][k]=0;
}else
{
map[j][k]=1;
}
}
}
dfs(0,0);
if (flag)
{
/* code */
cout<<"YES"<<endl;
}else
{
cout<<"NO"<<endl;
}
}
return 0;
}