hdu 1175 连连看

#include <stdio.h>
#include <string.h>
int n, m, d, q;
int x1,x2,y1,y2;
int field[1001][1001];
bool vis[1001][1001], flag;
void dfs(int x,int y, int d, int step)
{
	if(flag) return;
	if(x<1||x>n||y<1||y>m) return ;
	if(step>2)  return ;
	if(x==x2&&y==y2)
	{
		flag=true;
	   return ;
	}
	if(step==2)
	{
	      if(!((d==1&&y==y2&&x>x2)||(d==2&&y==y2&&x>x2)||(d==3&&x==x2&&y>y2)||(d==4&&x==x2&&y<y2)))
			  return ;
	}
	if(vis[x][y]) return;
	if(field[x][y]!=0) return ;
	vis[x][y]=true;
	if(d==1)
	{
	    dfs(x-1,y,1,step);
		dfs(x+1,y,2,step+1);
		dfs(x,y-1, 3,step+1);
		dfs(x,y+1, 4,step+1);
	}
	else if(d==2)
	{
	    dfs(x-1,y,1,step+1);
		dfs(x+1,y,2,step);
		dfs(x,y-1, 3,step+1);
		dfs(x,y+1, 4,step+1);
	}
	else if(d==3)
	{
	    dfs(x-1,y,1,step+1);
		dfs(x+1,y,2,step+1);
		dfs(x,y-1, 3,step);
		dfs(x,y+1, 4,step+1);
	}
	else if(d==4)
	{
	    dfs(x-1,y,1,step+1);
		dfs(x+1,y,2,step+1);
		dfs(x,y-1, 3,step+1);
		dfs(x,y+1, 4,step);
	}
	vis[x][y]=false;
}
int main()
{
	while(~scanf("%d%d",&n,&m)&&n&&m)
	{
		int i, j;
		flag=false;
        for(i=1; i<=n; i++)
			for(j=1; j<=m; j++)
				scanf("%d",&field[i][j]);
		scanf("%d",&q);
		for(i=0; i<q; i++)
		{
			memset(vis,0, sizeof(vis));
			flag=false;
			scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
			if(field[x1][y1]==field[x2][y2]&&field[x1][y1]!=0)
			{
			   dfs(x1-1, y1, 1, 0);//left
			   dfs(x1+1, y1, 2, 0);//right
			   dfs(x1, y1-1,3, 0);//down
			   dfs(x1,y1+1, 4, 0);//up
			   if(flag) puts("YES");
			   else puts("NO");
			}
			else puts("NO");
		}
	}
	return 0;
}