题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1240

Asteroids!

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3549 Accepted Submission(s): 2354

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

0 0 0

END

START 3

XXX

OOO

XXX

0 0 1

2 2 1

END

START 5

OOOOO

XXXXX

OOOOO

0 0 0

4 4 4

END

Sample Output

1 0

3 4

NO ROUTE

题目大意：在太空想回家，要避开星空中的行星。给了一张三维的地图，X代表行星区，O代表空白，然后给出起点和终点的坐标。

　　题目要求判断能否到达目的地，如果可以就输出N和最小的步数，否则输出NO ROUTE。

题目思路：大致就是一个普通的广搜就ok了，来找到最小的步数，其次的话就是注意输入，还有一个以"END"结束一个输入。

详见代码。

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <queue>
 4 
 5 using namespace std;
 6 
 7 int dir[6][3]={0,0,1,0,0,-1,0,1,0,0,-1,0,1,0,0,-1,0,0};
 8 char Map[25][25][25];
 9 int sx,sy,sz,ex,ey,ez,N,flag,step;
10 struct node{
11     int x,y,z,t;
12 }s,ss;
13 
14 void bfs()
15 {
16     queue<node>q,qq;
17     s.x=sx;
18     s.y=sy;
19     s.z=sz;
20     s.t=0;
21     q.push(s);
22     if (sx==ex&&sy==ey&&sz==ez)
23     {
24         flag=1;
25         step=0;
26         return ;
27     }
28     while (!q.empty())
29     {
30         s=q.front();
31         q.pop();
32         //cout<<"1"<<endl;
33         for (int i=0;i<6;i++)
34         {
35             int x=s.x+dir[i][0];
36             int y=s.y+dir[i][1];
37             int z=s.z+dir[i][2];
38             if (x>=0&&x<N&&y>=0&&y<N&&z>=0&&z<N&&Map[z][y][x]!='X')
39             {
40                 ss.x=x;
41                 ss.y=y;
42                 ss.z=z;
43                 ss.t=s.t+1;
44                 Map[z][y][x]='X';
45                 if (x==ex&&y==ey&&z==ez)
46                     {
47                         flag=1;
48                         step=ss.t;
49                         return ;
50                     }
51                     q.push(ss);
52             }
53         }
54     }
55 }
56 
57 
58 int main ()
59 {
60     char str[15],ch[15];
61 
62     while (scanf("%s%d",str,&N)!=EOF)
63     {
64         //flag=0;
65         for (int i=0;i<N;i++)
66             for (int j=0;j<N;j++)
67             scanf("%s",Map[i][j]);
68         scanf("%d%d%d",&sx,&sy,&sz);
69         scanf("%d%d%d",&ex,&ey,&ez);
70         scanf("%s",ch);
71         flag=0;
72         bfs();
73         if (flag==1)
74             printf ("%d %d\n",N,step);
75         else
76             printf ("NO ROUTE\n");
77     }
78     return 0;
79 }

posted on 2014-12-07 12:34 若忆_star 阅读(326) 评论(2) 收藏举报

刷新页面返回顶部