走迷宫（深搜）noj

#include<iostream>
#define true 1
#define false 0
using namespace std;

int m,n;
int sx,sy;
int ex,ey;
int maze[20][20];
int walk[4][2]={
	-1,0,//左
	0,1,//上
	0,-1,//下
    1,0,//右
};
void input();
void dfs(int x,int y);
int canMoveTo(int x,int y,int i);

int main()
{
	input();
	dfs(sx,sy);
	if(maze[ex][ey]==-1) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	return 0;
}
void input()
{
    int i,j;
	cin>>m>>n;
	cin>>sx>>sy;
	cin>>ex>>ey;
	for(i=0;i<m;i++){
		for(j=0;j<n;j++)
			cin>>maze[i][j];
	}
}
void dfs(int x,int y)
{
	int i;
	maze[x][y]=-1;
	for(i=0;i<4;i++){
		if(canMoveTo(x,y,i))
			dfs(x+walk[i][0],y+walk[i][1]);
	}
}
int canMoveTo(int x,int y,int i)
{
	if(x+walk[i][0]<0||y+walk[i][1]<0||x+walk[i][0]>=m||y+walk[i][1]>=n)return false;//判断是否越界
	else if(maze[x+walk[i][0]][y+walk[i][1]]==1||maze[x+walk[i][0]][y+walk[i][1]]==-1) return false;//判断是否撞墙和重复
	else return true;//可以行走
}