• HDU1242 Rescue


    Time Limit: 1000MS   Memory Limit: 32768KB   64bit IO Format: %I64d & %I64u

    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
     

    Source

    ZOJ Monthly, October 2003

     

    由于引入了"杀死守卫"这一额外耗费时间的情况,所以第一次BFS到终点时的解不一定最优,应该不断更新经过节点的值,直到不能更新,跑完整个BFS队列,才能得到最优解

     1 /*by SilverN*/
     2 #include<iostream>
     3 #include<algorithm>
     4 #include<cstring>
     5 #include<cstdio>
     6 #include<queue>
     7 #include<cmath>
     8 using namespace std;
     9 const int INF=300000;
    10 const int mxn=300;
    11 struct node{
    12     int x,y;
    13     int w;//用时 
    14 };
    15 queue<node>q;
    16 int mx[5]={0,1,0,-1,0},
    17     my[5]={0,0,1,0,-1};
    18 int ax,ay;
    19 char mp[mxn][mxn];
    20 int ans[mxn][mxn];
    21 int n,m;
    22 
    23 void BFS(node s){
    24     q.push(s);
    25     int i;
    26     node hd;
    27     while(!q.empty()){
    28         hd=q.front();
    29         q.pop();
    30         for(i=1;i<=4;i++){
    31             int x=hd.x+mx[i];
    32             int y=hd.y+my[i];
    33             if(x>0 && x<=n && y>0 && y<=m && mp[x][y]!='#'){
    34                 node v;
    35                 v.x=x; v.y=y; v.w=hd.w+1;
    36                 if(mp[x][y]=='x') v.w++;//杀死守卫要多花时间 
    37                 if(v.w<ans[x][y]){
    38                     ans[x][y]=v.w;
    39                     q.push(v);
    40                 }
    41             }
    42         }
    43     }
    44     return;
    45 }
    46 int main(){
    47     int i,j;
    48     while(scanf("%d%d",&n,&m)!=EOF){
    49         memset(mp,' ',sizeof(mp));
    50         int sx,sy;
    51         node ST;
    52         for(i=1;i<=n;i++){
    53             scanf("%s",mp[i]+1);
    54             for(j=1;j<=m;j++){
    55                 ans[i][j]=INF;
    56                 if(mp[i][j]=='a'){ax=i;ay=j;}
    57                 else if(mp[i][j]=='r'){sx=i;sy=j;}
    58                 else if(mp[i][j]!='.' && mp[i][j]!='x')mp[i][j]='#';
    59                 //从讨论区看到数据里可能有其他符号,也应算作# 
    60             }
    61         }
    62         ST.x=sx;ST.y=sy;ST.w=0;
    63         ans[sx][sy]=0;
    64         BFS(ST);
    65         if(ans[ax][ay]!=INF)printf("%d
    ",ans[ax][ay]);//有解 
    66         else printf("Poor ANGEL has to stay in the prison all his life.
    ");//无解 
    67     }
    68     return 0;
    69 }
  • 相关阅读:
    前端与后端的一些论述
    Pandas Cheat Sheet
    flask+socketio+echarts3 服务器监控程序(基于后端数据推送)
    【Java并发编程实战】-----“J.U.C”:ReentrantLock之一简介
    【Java并发编程实战】-----“J.U.C”:锁,lock
    【Java并发编程实战】-----synchronized
    【java并发编程实战】-----线程基本概念
    2015年读书系统
    阮一峰文集:《一个寻找作者的读者》
    进一步封装highchart,打造自己的图表插件:jHighChart.js
  • 原文地址:https://www.cnblogs.com/SilverNebula/p/5585859.html
Copyright © 2020-2023  润新知