HDU 1026 Ignatius and the Princess I (bfs + record path)

HDU 1026 Ignatius and the Princess I (bfs + record path)

 

Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission (s): 14184 Accepted Submission (s): 4474
Special Judge

Problem Description The Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. now he gets into feng5166's castle. the castle is a large labyrinth. to make the problem simply, we assume the labyrinth is a N * M two-dimen1_array which left-top corner is () and right-bottom corner is (N-1, M-1 ). ignatius enters at (0, 0), and the door to feng5166's room is at (N-1, M-1), that is our target. there are some monsters in the castle, if Ignatius meet them, he has to kill them. here is some rules:

1. ignatius can only move in four directions ctions (up, down, left, right), one step per second. A step is defined as follow: if current position is (x, y), after a step, Ignatius can only stand on (x-1, y), (x + 1, y ), (x, Y-1) or (x, y + 1 ).
2. The array is marked with some characters and numbers. We define them like this:
.: The place where Ignatius can walk on.
X: The place is a trap, Ignatius shocould not walk on it.
N: Here is a monster with n HP (1 <= n <= 9), if Ignatius walk on it, it takes him n seconds to kill the monster.

Your task is to give out the path which costs minimum seconds for Ignatius to reach target position. you may assume that the start position and the target position will never be a trap, and there will never be a monster at the start position.

Input The input contains several test cases. each test case starts with a line contains two numbers N and M (2 <= N <= 100,2 <= M <= 100) which indicate the size of the labyrinth. then a N * M two-dimen1_array follows, which describe the whole labyrinth. the input is terminated by the end of file. more details in the Sample Input.

Output For each test case, you shoshould output God please help our poor hero. if Ignatius can't reach the target position, or you shoshould output It takes n seconds to reach the target position, let me show you the way. (n is the minimum seconds), and tell our hero the whole path. output a line contains FINISH after each test case. if there are more than one path, any one is OK in this problem. more details in the Sample Output.

Sample Input

5 6.XX.1...X.2.2...X....XX.XXXXX.5 6.XX.1...X.2.2...X....XX.XXXXX15 6.XX.....XX1.2...X....XX.XXXXX.

Sample Output

It takes 13 seconds to reach the target position, let me show you the way.1s:(0,0)->(1,0)2s:(1,0)->(1,1)3s:(1,1)->(2,1)4s:(2,1)->(2,2)5s:(2,2)->(2,3)6s:(2,3)->(1,3)7s:(1,3)->(1,4)8s:FIGHT AT (1,4)9s:FIGHT AT (1,4)10s:(1,4)->(1,5)11s:(1,5)->(2,5)12s:(2,5)->(3,5)13s:(3,5)->(4,5)FINISHIt takes 14 seconds to reach the target position, let me show you the way.1s:(0,0)->(1,0)2s:(1,0)->(1,1)3s:(1,1)->(2,1)4s:(2,1)->(2,2)5s:(2,2)->(2,3)6s:(2,3)->(1,3)7s:(1,3)->(1,4)8s:FIGHT AT (1,4)9s:FIGHT AT (1,4)10s:(1,4)->(1,5)11s:(1,5)->(2,5)12s:(2,5)->(3,5)13s:(3,5)->(4,5)14s:FIGHT AT (4,5)FINISHGod please help our poor hero.FINISH

 

 

 

 

 

 

/* Start Point () End Point (N-1 m-1), 'x' indicates that you cannot go ,'. 'You can go. It takes one second to come. A number indicates that you can go. However, you still need to add this number to the priority queue after a second, open a path array for the record path to record the point from which it comes, and then recursively output the path */# include
 
  
# Include
  
   
# Include
   
    
# Include
    
     
# Include
     
      
# Include
      
        # Include
       
         # Include
        
          # Include
         # Define L (x) (x <1) # define R (x) (x <1 | 1) # define MID (x, y) (x + y)> 1) # define eps 1e-8typedef _ int64 ll; # define fre (I, a, B) for (I = a; I
          
            = A; I --) # define mem (t, v) memset (t), v, sizeof (t) # define ssf (n) scanf (% s, n) # define sf (n) scanf (% d, & n) # define sff (a, B) scanf (% d, & a, & B) # define sfff (a, B, c) scanf (% d, & a, & B, & c) # define pf printf # define bug pf (Hi) using namespace std; # define N 105 struct stud {stud (int xx, int yy, int s): x (xx), y (yy), step (s ){}; stud () {}; int x, y, step; bool operator <(const stud B) const {return step> B. step ;}}; int n, m; priority_queue
           
             Q; int path [N] [N]; int vis [N] [N]; int step [4] [2] = {,-, 0, -1}; int all; char c [N] [N]; bool judge (int x, int y) {if (x> = 0 & x
            
              = 0 & y
             
               (% D, % d), ++ all, xx, yy, x, y ); if (c [x] [y]> = '0' & c [x] [y] <= '9 ') {int I = c [x] [y]-'0'; while (I --) printf (% ds: FIGHT AT (% d, % d), ++ all, x, y) ;}} bool bfs () {int I, j; stud cur, next; while (! Q. empty () q. pop (); mem (vis, 0); vis [0] [0] = 1; cur. x = 0; cur. y = 0; cur. step = 0; q. push (cur); while (! Q. empty () {cur = q. top (); q. pop (); if (cur. x = n-1 & cur. y = m-1) {printf (It takes % d seconds to reach the target position, let me show you the way ., cur. step); all = 0; show (N-1 m-1); return true ;}for (I = 0; I <4; I ++) {int xx = cur. x + step [I] [0]; int yy = cur. y + step [I] [1]; if (! Judge (xx, yy) continue; if (vis [xx] [yy]) continue; if (c [xx] [yy] = 'X') continue; next. x = xx; next. y = yy; next. step = cur. step + 1; if (c [xx] [yy]> = '0' & c [xx] [yy] <= '9') next. step + = c [xx] [yy]-'0'; q. push (next); vis [xx] [yy] = cur. step + 1; path [xx] [yy] = I;} return false;} int main () {int I, j; while (~ Scanf (% d, & n, & m) {for (I = 0; I