Problem Description
You’re in space.
You want to get home.
There are asteroids.
You don’t want to hit them.
Input
Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets.
A single data set has 5 components:
Start line - A single line, “START N”, where 1 <= N <= 10.
Slice list - A series of N slices. Each slice is an N x N matrix representing a horizontal slice through the asteroid field. Each position in the matrix will be one of two values:
‘O’ - (the letter “oh”) Empty space
‘X’ - (upper-case) Asteroid present
Starting Position - A single line, “A B C”, denoting the <A,B,C> coordinates of your craft’s starting position. The coordinate values will be integers separated by individual spaces.
Target Position - A single line, “D E F”, denoting the <D,E,F> coordinates of your target’s position. The coordinate values will be integers separated by individual spaces.
End line - A single line, “END”
The origin of the coordinate system is <0,0,0>. Therefore, each component of each coordinate vector will be an integer between 0 and N-1, inclusive.
The first coordinate in a set indicates the column. Left column = 0.
The second coordinate in a set indicates the row. Top row = 0.
The third coordinate in a set indicates the slice. First slice = 0.
Both the Starting Position and the Target Position will be in empty space.
Output
For each data set, there will be exactly one output set, and there will be no blank lines separating output sets.
A single output set consists of a single line. If a route exists, the line will be in the format “X Y”, where X is the same as N from the corresponding input data set and Y is the least number of moves necessary to get your ship from the starting position to the target position. If there is no route from the starting position to the target position, the line will be “NO ROUTE” instead.
A move can only be in one of the six basic directions: up, down, left, right, forward, back. Phrased more precisely, a move will either increment or decrement a single component of your current position vector by 1.
Sample Input
START 1
O
0 0 0
0 0 0
END
START 3
XXX
XXX
XXX
OOO
OOO
OOO
XXX
XXX
XXX
0 0 1
2 2 1
END
START 5
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
XXXXX
XXXXX
XXXXX
XXXXX
XXXXX
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
0 0 0
4 4 4
END
Sample Output
1 0
3 4
NO ROUTE
题目大意:三维空间,从起始位置走到目标位置,只能走空地(‘O’),每次只能走一步,求最少需要几步。
解题思路:看到这种三维的,首先不要虚,和二维的其实差不多,只不过多了两种走法(上下左右前后),用BFS就是干!!!
代码如下:
#include<stdio.h>
#include<string.h>
struct Q
{
int x,y,z;
int step;
}queue[1005*1005]; //用结构体数组模仿队列
int judge[101][101][101]; //剪枝
int x,y,z,x1,y1,z1,n;
char str[101][101][101];
int dir1[6] = {0,0,-1,1,0,0}; //一竖条,一竖条的看,分别代表上下左右前后;其实也能用二维数组表示
int dir2[6] = {0,0,0,0,1,-1};
int dir3[6] = {1,-1,0,0,0,0};
void BFS(); //广搜
int main()
{
int i,j;
char ch[20];
while(~scanf("%s%d",ch,&n))
{
memset(judge,0,sizeof(judge)); //注意初始化,避免前面的数据对后面的测试造成影响
for(i = 0 ; i < n ; i++)
{
for(j = 0 ; j < n ; j++)
{
scanf("%s",str[i][j]); //注意首个[]表示层数
}
}
scanf("%d%d%d%d%d%d",&x,&y,&z,&x1,&y1,&z1);
scanf("%s",ch);
BFS();
}
}
void BFS()
{
struct Q temp;
int head = 0, rear = 0;
int i,a,b,c;
queue[rear].x = x;
queue[rear].y = y;
queue[rear].z = z;
queue[rear++].step = 0;
judge[z][y][x] = 1; //与输入保持一致收割[]表示层数
while(head < rear) //队列不为空
{
temp = queue[head++];
if(temp.x == x1 && temp.y == y1 &&temp.z == z1) //走到目标位置
{
printf("%d %d\n",n,temp.step);
return ;
}
for(i = 0 ; i < 6 ; i++) //上下左右前后六次的移动
{
a = temp.x + dir1[i];
b = temp.y + dir2[i];
c = temp.z + dir3[i];
if(a >= 0 && b >= 0 && c >= 0 && a < n && b < n && c < n &&!judge[c][b][a]&&str[c][b][a] == 'O')
{
queue[rear].x = a;
queue[rear].y = b;
queue[rear].z = c;
queue[rear++].step = temp.step+1;
judge[c][b][a] = 1; //标记已经走过
}
}
}
printf("NO ROUTE\n");
}