codeup5978: 走迷宫DFS实现

codeup5978: 【递归入门】走迷宫

http://codeup.cn/problem.php?id=5978

#include <iostream>
using namespace std;

int n,m,begin_x,begin_y,end_x,end_y,top=-1,exist=0;
int map[16][16],book[16][16],stack_x[500],stack_y[500];
int direction[4][2] = {{0,-1},{-1,0},{0,1},{1,0}};

void read(){
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			scanf("%d",&map[i][j]);
			book[i][j] = 0;
		}
	}
	scanf("%d %d %d %d",&begin_x,&begin_y,&end_x,&end_y);	
}

void dfs(int x, int y){
	if(x==end_x && y==end_y){
		exist = 1;
		printf("(%d,%d)",begin_x,begin_y);
		for(int i=0;i<=top;i++){
			printf("->(%d,%d)",stack_x[i],stack_y[i]);
		}
		printf("\n");
		return;
	}
	int tx,ty;
	for(int d=0;d<4;d++){
		tx = x + direction[d][0];
		ty = y + direction[d][1];
		if(tx<1 || tx>n || ty<1 || ty>m) continue;
		if(map[tx][ty]==1 && book[tx][ty]==0){
			book[tx][ty] = 1;
			stack_x[++top] = tx;
			stack_y[top] = ty;
			dfs(tx,ty);
			--top;
			book[tx][ty] = 0;
		}
	}
}

int main(){
	read();
	book[begin_x][begin_y] = 1;
	dfs(begin_x, begin_y);
	if(exist == 0){
		printf("-1");
	}
	return 0;
}