Rescue-HDU-深搜
来源:互联网 发布:京东和淘宝双11销售额 编辑:程序博客网 时间:2024/06/05 11:50
Rescue
Problem Description
Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs in the prison.
Angel's friends want to save Angel. Their task is: approach Angel. We assume that "approach Angel" is to get to the position where Angel stays. When there's a guard in the grid, we must kill him (or her?) to move into the grid. We assume that we moving up, down, right, left takes us 1 unit time, and killing a guard takes 1 unit time, too. And we are strong enough to kill all the guards.
You have to calculate the minimal time to approach Angel. (We can move only UP, DOWN, LEFT and RIGHT, to the neighbor grid within bound, of course.)
Input
First line contains two integers stand for N and M. Then N lines follows, every line has M characters. "." stands for road, "a" stands for Angel, and "r" stands for each of Angel's friend. Process to the end of the file.
Output
For each test case, your program should output a single integer, standing for the minimal time needed. If such a number does no exist, you should output a line containing "Poor ANGEL has to stay in the prison all his life."
Sample Input
7 8#.#####.#.a#..r.#..#x.....#..#.##...##...#..............
Sample Output
13
#include<iostream>using namespace std;char ch[205][205];int visit[205][205];int minlen,m,n,len;void dfs(int x,int y,int len){ if(len>minlen) return; if(ch[x][y]=='#'||visit[x][y]==1||x<0||y<0||x>=m||y>=n) return; if(ch[x][y]=='r'){ if(len<minlen) minlen=len; return; } if(ch[x][y]=='x') len++; visit[x][y]=1; dfs(x-1,y,len+1); dfs(x,y+1,len+1); dfs(x+1,y,len+1); dfs(x,y-1,len+1); visit[x][y]=0;}int main(){ int ax,ay; while(cin>>m>>n){ for(int i=0;i<=m-1;i++){ for(int j=0;j<=n-1;j++){ cin>>ch[i][j]; if(ch[i][j]=='a'){ ax=i; ay=j; } } } minlen=205*205; len=0; dfs(ax,ay,len); if(minlen==205*205) cout<<"Poor ANGEL has to stay in the prison all his life."<<endl; else cout<<minlen<<endl; } return 0;}
- Rescue-HDU-深搜
- hdu Rescue
- HDU Rescue
- Rescue HDU
- Rescue HDU
- HDU 1242 Rescue(dfs深搜)
- hdu 1242 Rescue
- HDU-1242-Rescue
- HDU 1242 Rescue
- HDU-1242 Rescue
- hdu 1242 Rescue
- hdu 1242 Rescue<java>
- hdu 1242 rescue
- HDU-1242:Rescue
- HDU 1242 Rescue
- HDU 1242 Rescue
- hdu 1242 Rescue
- hdu 1242 Rescue
- git 如何避免push错分支
- 初步认识Node.js
- Junit几个实用功能
- superset连接数据库
- Win10 系统下 Mysql 字符集(utf8)的设置
- Rescue-HDU-深搜
- android设备调试卡顿 waitiong for the debugger to attach卡顿
- ORCALE sql
- 求两数的最小公倍数
- java 线条文字
- okhttp get方法
- 历史上第一位从事游戏开发与设计的女程序员
- dom 获取子节点 删除非空节点
- 两个实数的交换