深度遍历搜索DFS

我发现深度遍历搜索其实用的算法就是递归啊。。。

这种成了模型的代码还是要多敲练手感。。

九度1461

这个程序敲得很顺，但是debug了好久，因为各种细节问题。。

题目描述：

The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and he tried desperately to get out of this maze.
The maze was a rectangle with sizes N by M. There was a door in the maze. At the beginning, the door was closed and it would open at the T-th second for a short period of time (less than 1 second). Therefore the doggie had to arrive at the door on exactly the T-th second. In every second, he could move one block to one of the upper, lower, left and right neighboring blocks. Once he entered a block, the ground of this block would start to sink and disappear in the next second. He could not stay at one block for more than one second, nor could he move into a visited block. Can the poor doggie survive? Please help him.

输入：

The input consists of multiple test cases. The first line of each test case contains three integers N, M, and T (1 < N, M < 7; 0 < T < 50), which denote the sizes of the maze and the time at which the door will open, respectively. The next N lines give the maze layout, with each line containing M characters. A character is one of the following:
'X': a block of wall, which the doggie cannot enter; 
'S': the start point of the doggie; 
'D': the Door; or
'.': an empty block.
The input is terminated with three 0's. This test case is not to be processed. 

输出：

For each test case, print in one line "YES" if the doggie can survive, or "NO" otherwise.

样例输入：

4 4 5
S.X.
..X.
..XD
....
3 4 5
S.X.
..X.
...D
0 0 0

样例输出：

NO
YES

#include<stdio.h>
using namespace std;
bool mark[7][7];
int hash[7][7];
char maze[7][7];
int t;
int n, m;
int startn, startm;
int endn, endm;
int flag;
int go[][2] = { //坐标变换数组
	1, 0,
	-1, 0,
	0, 1,
	0, -1
};
void dfs(int sn, int sm, int en, int em,int tt) {
	int i;
	int newn, newm;
	if (sn == en&&sm == em) {//成功
		if (tt == t) {
			flag = 1; //记录有解
		}
		return;
	}

	for (i = 0; i < 4; i++) {
			int newn = sn + go[i][0];
			int newm = sm + go[i][1];
			if (mark[newn][newm] == true) continue; //如果已经被标记过
			if (hash[newn][newm] == 1) continue;  //如果是障碍物
			if (newn < 0 || newn >= n || newm < 0 || newm >= m) continue;
			mark[newn][newm] = true;
			dfs(newn, newm, en, em, tt + 1);
			mark[newn][newm] = false;
	}
}
int main() {
	while (scanf("%d%d%d", &n, &m, &t) != EOF) {
		if (n == 0 && m == 0 && t == 0) break;
		int i, j;
		flag = 0;
		for (i = 0; i < n; i++) {
			scanf("%s", maze[i]);
		}
		for (i = 0; i < n; i++) {
			for (j = 0; j < m; j++) {
				hash[i][j] = 0;
				mark[i][j] = false; //初始化为未被标记
				if (maze[i][j] == 'S') {
					startn = i;
					startm = j;
				}
				if (maze[i][j] == 'D') {
					endn = i;
					endm = j;
					hash[i][j] = 0;//终点也要先
				}
				if (maze[i][j] == '.') {
					hash[i][j] = 0;
				}
				if (maze[i][j] == 'X') {
					hash[i][j] = 1;
				}
				
			}
		}
		dfs(startn, startm, endn, endm, 0);
		if (flag == 1) {
			printf("YES\n");
		}
		else {
			printf("NO\n");
		}
	}
	return 0;
}

POJ3009

Description

On Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different from ours. The game is played on an ice game board on which a square mesh is marked. They use only a single stone. The purpose of the game is to lead the stone from the start to the goal with the minimum number of moves.

Fig. 1 shows an example of a game board. Some squares may be occupied with blocks. There are two special squares namely the start and the goal, which are not occupied with blocks. (These two squares are distinct.) Once the stone begins to move, it will proceed until it hits a block. In order to bring the stone to the goal, you may have to stop the stone by hitting it against a block, and throw again.

Fig. 1: Example of board (S: start, G: goal)

The movement of the stone obeys the following rules:

• At the beginning, the stone stands still at the start square.
• The movements of the stone are restricted to x and y directions. Diagonal moves are prohibited.
• When the stone stands still, you can make it moving by throwing it. You may throw it to any direction unless it is blocked immediately(Fig. 2(a)).
• Once thrown, the stone keeps moving to the same direction until one of the following occurs:
  • The stone hits a block (Fig. 2(b), (c)).
    • The stone stops at the square next to the block it hit.
    • The block disappears.
  • The stone gets out of the board.
    • The game ends in failure.
  • The stone reaches the goal square.
    • The stone stops there and the game ends in success.
• You cannot throw the stone more than 10 times in a game. If the stone does not reach the goal in 10 moves, the game ends in failure.

Fig. 2: Stone movements

Under the rules, we would like to know whether the stone at the start can reach the goal and, if yes, the minimum number of moves required.

With the initial configuration shown in Fig. 1, 4 moves are required to bring the stone from the start to the goal. The route is shown in Fig. 3(a). Notice when the stone reaches the goal, the board configuration has changed as in Fig. 3(b).

Fig. 3: The solution for Fig. D-1 and the final board configuration

Input

The input is a sequence of datasets. The end of the input is indicated by a line containing two zeros separated by a space. The number of datasets never exceeds 100.

Each dataset is formatted as follows.

the width(=w) and the height(=h) of the board
First row of the board
...
h-th row of the board

The width and the height of the board satisfy: 2 <= w <= 20, 1 <= h <= 20.

Each line consists of w decimal numbers delimited by a space. The number describes the status of the corresponding square.

0	vacant square
1	block
2	start position
3	goal position

The dataset for Fig. D-1 is as follows:

6 6
1 0 0 2 1 0
1 1 0 0 0 0
0 0 0 0 0 3
0 0 0 0 0 0
1 0 0 0 0 1
0 1 1 1 1 1

Output

For each dataset, print a line having a decimal integer indicating the minimum number of moves along a route from the start to the goal. If there are no such routes, print -1 instead. Each line should not have any character other than this number.

Sample Input

2 1
3 2
6 6
1 0 0 2 1 0
1 1 0 0 0 0
0 0 0 0 0 3
0 0 0 0 0 0
1 0 0 0 0 1
0 1 1 1 1 1
6 1
1 1 2 1 1 3
6 1
1 0 2 1 1 3
12 1
2 0 1 1 1 1 1 1 1 1 1 3
13 1
2 0 1 1 1 1 1 1 1 1 1 1 3
0 0

Sample Output

1
4
-1
4
10
-1

#include<stdio.h>    int dir[4][2] = { { 1,0 },{ -1,0 },{ 0,1 },{ 0,-1 } }; int ei, ej; int map[25][25]; int w, h, steps, min; #define MAX 99999999    void dfs(int si, int sj) {  int i, pi, pj;  if (steps >= 10) return;

 for (i = 0; i<4; i++)  {   pi = si, pj = sj;   while (1)   {    pi += dir[i][0];    pj += dir[i][1];    if (pi <= 0 || pi>h || pj <= 0 || pj>w) break;//如果越界，选择其他方向       if (pi == ei&&pj == ej)    {     if (min>steps) min = steps;     return;    }    else if (map[pi][pj] == 1)//如果遇到障碍物       {

    if (pi - dir[i][0] != si || pj - dir[i][1] != sj)//如果不是起来        {      map[pi][pj] = 0;//消除障碍物         steps++;//前进一步         dfs(pi - dir[i][0], pj - dir[i][1]);//递归查找该点到终点的最小步数         map[pi][pj] = 1;//还原障碍物         steps--;//还原步数        }     break;    }   }  } } int main() {  int si, sj, i, j;  while (scanf("%d%d", &w, &h) == 2 && (w || h))  {   for (i = 1; i <= h; i++)//输入并找到起点和终点       for (j = 1; j <= w; j++)    {     scanf("%d", &map[i][j]);     if (map[i][j] == 2)      si = i, sj = j;     else if (map[i][j] == 3)      ei = i, ej = j;    }   min = MAX;//记录最小步数      steps = 1;//初始化步数      dfs(si, sj);//深搜      if (min == MAX) puts("-1");   else printf("%d\n", min);  }  return 0; }