HDOJ 1240 Asteroids!

HDOJ 1240 Asteroids!

 

 

Asteroids! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission (s): 3643 Accepted Submission (s): 2413


Problem Description You're in space.
You want to get home.
There are asteroids.
You don't have want to hit them.

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 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 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>. Therefore, each component of each coordinate vector will be an integer between 0 and N-1, fully passive.

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 1O0 0 00 0 0ENDSTART 3XXXXXXXXXOOOOOOOOOXXXXXXXXX0 0 12 2 1ENDSTART 5OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOXXXXXXXXXXXXXXXXXXXXXXXXXOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO0 0 04 4 4END

Sample Output

1 03 4NO ROUTE

Source South Central USA 2001

 

Question: The minimum number of steps from one point to another in a three-dimensional space.

Problem solving; BFS template, mainly to pay attention to coordinate processing.

AC code:

 

# Include
  
   
# Include
   
    
# Include
    
     
# Include
     
      
# Define N 15 using namespace std; char chess [N] [N] [N]; string str; int n, sx, sy, sz, ex, ey, ez, visit [N] [N] [N]; int dir [] [3] = {0, 1}, {0,-1}, {, 0 }, {-, 0 },{, 0 },{ 0,-}}; struct Node {int x, y, z, s ;}; bool OK (int x, int y, int z) {if (x> = 0 & x
      
       
= 0 & y
       
         = 0 & z
        
          Q; Node head = {sx, sy, sz, 0}; q. push (head); memset (visit,-1, sizeof (visit); visit [sx] [sy] [sz] = 0; while (q. size () {Node f = q. front (); if (f. x = ex & f. y = ey & f. z = ez) return f. s; q. pop (); for (int I = 0; I <6; I ++) {int dx = f. x + dir [I] [0], dy = f. y + dir [I] [1], dz = f. z + dir [I] [2]; if (OK (dx, dy, dz) & visit [dx] [dy] [dz]) {visit [dx] [dy] [dz] = 0; Node t = {dx, dy, dz, f. s + 1}; q. push (t) ;}}} return-1 ;}int main () {while (cin >>> str >> n) {for (int I = 0; I
         
           > Chess [k] [j] [I]; cin> sx> sy> sz> ex> ey> ez; cin> str; int tmp = bfs (); if (tmp! =-1) cout <
          
            [Reprinted with the source]
           
 
           
Author: MummyDing
           
Source: http://blog.csdn.net/mummyding