NYOJ58.最少步数(DFS)

最少步数

时间限制： 3000 ms  |  内存限制： 65535 KB

难度： 4

描述

这有一个迷宫，有0~8行和0~8列：

 1,1,1,1,1,1,1,1,1
 1,0,0,1,0,0,1,0,1
 1,0,0,1,1,0,0,0,1
 1,0,1,0,1,1,0,1,1
 1,0,0,0,0,1,0,0,1
 1,1,0,1,0,1,0,0,1
 1,1,0,1,0,1,0,0,1
 1,1,0,1,0,0,0,0,1
 1,1,1,1,1,1,1,1,1

0表示道路，1表示墙。

现在输入一个道路的坐标作为起点，再如输入一个道路的坐标作为终点，问最少走几步才能从起点到达终点？

（注：一步是指从一坐标点走到其上下左右相邻坐标点，如：从（3，1）到（4,1）。）

输入

第一行输入一个整数n（0<n<=100），表示有n组测试数据;
随后n行,每行有四个整数a,b,c,d（0<=a,b,c,d<=8）分别表示起点的行、列，终点的行、列。

输出

输出最少走几步。

样例输入

2
3 1  5 7
3 1  6 7

样例输出

12
11

比较典型的DFS

#include<stdio.h>
int map[9][9] = { {1,1,1,1,1,1,1,1,1},
                  {1,0,0,1,0,0,1,0,1},
                  {1,0,0,1,1,0,0,0,1},
                  {1,0,1,0,1,1,0,1,1},
                  {1,0,0,0,0,1,0,0,1},
                  {1,1,0,1,0,1,0,0,1},
                  {1,1,0,1,0,1,0,0,1},
                  {1,1,0,1,0,0,0,0,1},
                  {1,1,1,1,1,1,1,1,1}};
int a[4] = {0, 1, 0, -1}, b[4] = {1, 0, -1, 0};
int m, n, num, ans;//num计算步数, ans计算最短步数 
void dfs(int x, int y, int num) {
  int q = 0, k = 0, u, v;
  if(x == m && y == n)
    if(num < ans)//这里可能有些难理解 其实是回溯过程
      ans = num;
  while(!q && k < 4) {
    u = x + a[k];
    v = y + b[k];
    if(u < 9 && u >= 0 && v < 9 && u >= 0 && map[u][v] == 0) {
      map[u][v] = 1;
      dfs(u, v, num+1);
      map[u][v] = 0;
    }
    k++;
  }
}
int main() {
  int t;
  scanf("%d", &t);
  while(t--) {
    int x, y;      
    ans = 99999;
    scanf("%d%d%d%d", &x, &y, &m, &n);
    dfs(x, y, 0);
    printf("%d\n", ans);
  }
} 

打表观察回溯过程

2
3 1  5 7
num = 14
1 1 1 1 1 1 1 1 1
1 0 0 1 0 0 1 0 1
1 0 0 1 1 0 0 0 1
1 * 1 0 1 1 0 1 1
1 * * * * 1 0 0 1
1 1 0 1 * 1 * * 1
1 1 0 1 * 1 * * 1
1 1 0 1 * * * * 1
1 1 1 1 1 1 1 1 1
num = 16
1 1 1 1 1 1 1 1 1
1 0 0 1 0 0 1 0 1
1 0 0 1 1 0 0 0 1
1 * 1 0 1 1 0 1 1
1 * * * * 1 * * 1
1 1 0 1 * 1 * * 1
1 1 0 1 * 1 * * 1
1 1 0 1 * * * * 1
1 1 1 1 1 1 1 1 1
num = 12
1 1 1 1 1 1 1 1 1
1 0 0 1 0 0 1 0 1
1 0 0 1 1 0 0 0 1
1 * 1 0 1 1 0 1 1
1 * * * * 1 0 0 1
1 1 0 1 * 1 0 * 1
1 1 0 1 * 1 0 * 1
1 1 0 1 * * * * 1
1 1 1 1 1 1 1 1 1
num = 12
1 1 1 1 1 1 1 1 1
1 0 0 1 0 0 1 0 1
1 0 0 1 1 0 0 0 1
1 * 1 0 1 1 0 1 1
1 * * * * 1 0 0 1
1 1 0 1 * 1 0 * 1
1 1 0 1 * 1 * * 1
1 1 0 1 * * * 0 1
1 1 1 1 1 1 1 1 1
num = 12
1 1 1 1 1 1 1 1 1
1 0 0 1 0 0 1 0 1
1 0 0 1 1 0 0 0 1
1 * 1 0 1 1 0 1 1
1 * * * * 1 0 0 1
1 1 0 1 * 1 * * 1
1 1 0 1 * 1 * 0 1
1 1 0 1 * * * 0 1
1 1 1 1 1 1 1 1 1
num = 14
1 1 1 1 1 1 1 1 1
1 0 0 1 0 0 1 0 1
1 0 0 1 1 0 0 0 1
1 * 1 0 1 1 0 1 1
1 * * * * 1 * * 1
1 1 0 1 * 1 * * 1
1 1 0 1 * 1 * 0 1
1 1 0 1 * * * 0 1
1 1 1 1 1 1 1 1 1

#include<stdio.h>
#include<string.h>
char map[9][10] = {"111111111", "100100101", "100110001", "101011011",
    "100001001", "110101001", "110101001", "110100001", "111111111" };
int a[4] = {0, 1, 0, -1}, b[4] = {1, 0, -1, 0}, m, n, num;
void dfs(int x, int y, int num) {
  int q = 0, k = 0, u, v;
  if(x == m && y == n) {
    printf("num = %d\n", num);
    for(int i = 0; i < 9; i++){
      for(int j = 0; j < 9; j++)
        printf("%c ", map[i][j]);
      printf("\n");
    }
  }
  while(q == 0 && k < 4) {
    u = x + a[k];
    v = y + b[k];
    if(u < 9 && u >= 0 && v < 9 && u >= 0 && map[u][v] == '0') {
      map[u][v] = '*';
      dfs(u, v, num+1);
      map[u][v] = '0';
    }
    k++;
  }
}
int main() {
  int t;
  scanf("%d", &t);
  while(t--) {
    int x, y;      
    scanf("%d%d%d%d", &x, &y, &m, &n);
    map[x][y] = '*';
    dfs(x, y, 0);
  }
}
//用来观察路线的代码...