最少步数
时间限制:
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,10表示道路,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
思路很简单,找出从起点到终点的所有走法,选择步数最小的那个,即为所求。
#include <stdio.h> #define ACCESS 0 #define IMPASSABILITY 1 #define INFINITE 1000 int mazeMap[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 direction[4][2] = {-1, 0, 0, 1, 1, 0, 0, -1}; int exitX, exitY; void ExploreMaze(int currentX, int currentY, int currentStep, int &minStep) { int nextStepX, nextStepY; if (currentX == exitX && currentY == exitY) { if (currentStep < minStep) { minStep = currentStep; } return; } mazeMap[currentX][currentY] = IMPASSABILITY; for (int i = 0; i < 4; i++) { nextStepX = currentX + direction[i][0]; nextStepY = currentY + direction[i][1]; if (mazeMap[nextStepX][nextStepY] == ACCESS && currentStep+1 < minStep) { ExploreMaze(nextStepX, nextStepY, currentStep+1, minStep); mazeMap[nextStepX][nextStepY] = ACCESS; } } } int main() { int testNum, startX, startY, minStep; scanf("%d", &testNum); while (testNum-- != 0) { scanf("%d%d%d%d", &startX, &startY, &exitX, &exitY); minStep = INFINITE; ExploreMaze(startX, startY, 0, minStep); mazeMap[startX][startY] = ACCESS; printf("%d\n", minStep); } return 0; }
-
第一行输入一个整数n(0<n<=100),表示有n组测试数据;