http://acm.hdu.edu.cn/showproblem.php?pid=1026
Ignatius and the Princess I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9535 Accepted Submission(s): 2830
Special Judge
array which left-top corner is (0,0) 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(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 should 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.
by the end of file. More details in the Sample Input.
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.
5 6 .XX.1. ..X.2. 2...X. ...XX. XXXXX. 5 6 .XX.1. ..X.2. 2...X. ...XX. XXXXX1 5 6 .XX... ..XX1. 2...X. ...XX. XXXXX.
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) FINISH It 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) FINISH God please help our poor hero. FINISH
BFS + 路径输出
code:
#include <iostream> #include <cstdio> #include <cstring> #include <queue> #define INF 0x7f7f7f7f using namespace std; int n,m,flag; char map[110][110]; bool visited[110][110]; int dir[4][2]= {{1,0},{0,1},{-1,0},{0,-1}}; struct node { int x,y,step; int pre_dir; } s_pos,count_map[110][110]; void print_path(int pre_dir,int x,int y,int step) { int pre_x=x-dir[pre_dir][0],pre_y=y-dir[pre_dir][1]; if(x==0&&y==0) return ; else { if(map[x][y]=='.') { print_path(count_map[pre_x][pre_y].pre_dir,pre_x,pre_y,step-1); printf("%ds:(%d,%d)->(%d,%d)\n",step,pre_x,pre_y,x,y); } else { print_path(count_map[pre_x][pre_y].pre_dir,pre_x,pre_y,step-(map[x][y]-'0')-1); printf("%ds:(%d,%d)->(%d,%d)\n",step-(map[x][y]-'0'),pre_x,pre_y,x,y); for(int i=map[x][y]-'0'-1; i>=0; i--) { printf("%ds:FIGHT AT (%d,%d)\n",step-i,x,y); } } } } bool cheak(int x,int y) { if(x>=0&&x<n&&y>=0&&y<m&&map[x][y]!='X') return true; return false; } void bfs() { s_pos.x=0,s_pos.y=0,s_pos.step=0; s_pos.pre_dir = -1; visited[s_pos.x][s_pos.y]=true; queue<node > q; q.push(s_pos); while(!q.empty()) { node now=q.front(); q.pop(); if(now.x==n-1&&now.y==m-1) { flag=1; } for(int i=0; i<4; i++) { node next=now; next.x+=dir[i][0],next.y+=dir[i][1]; if(cheak(next.x,next.y)) { if(map[next.x][next.y]=='.') { next.step+=1; if(next.step<count_map[next.x][next.y].step) { count_map[next.x][next.y].step=next.step; count_map[next.x][next.y].pre_dir=i; q.push(next); } } else if(map[next.x][next.y]>='1'&&map[next.x][next.y]<='9') { next.step+=map[next.x][next.y]-'0'+1; if(next.step<count_map[next.x][next.y].step) { count_map[next.x][next.y].step=next.step; count_map[next.x][next.y].pre_dir=i; q.push(next); } } } } } } int main() { int i,j; while(cin>>n>>m) { for(i=0; i<n; i++) cin>>map[i]; memset(visited,false,sizeof(visited)); for(i=0; i<n; i++) for(j=0; j<m; j++) count_map[i][j].step=INF; flag=0; bfs(); if(!flag) { printf("God please help our poor hero.\n"); printf("FINISH\n"); } else { printf("It takes %d seconds to reach the target position, let me show you the way.\n",count_map[n-1][m-1].step); print_path(count_map[n-1][m-1].pre_dir,n-1,m-1,count_map[n-1][m-1].step); printf("FINISH\n"); } } return 0; }