POJ3170 Bzoj1671 [Usaco2005 Dec]Knights of Ni 骑士

1671: [Usaco2005 Dec]Knights of Ni 骑士

Time Limit: 5 Sec Memory Limit: 64 MB
Submit: 281 Solved: 180
[Submit][Status][Discuss]

Description

Bessie is in Camelot and has encountered a sticky situation: she needs to pass through the forest that is guarded by the Knights of Ni. In order to pass through safely, the Knights have demanded that she bring them a single shrubbery. Time is of the essence, and Bessie must find and bring them a shrubbery as quickly as possible. Bessie has a map of of the forest, which is partitioned into a square grid arrayed in the usual manner, with axes parallel to the X and Y axes. The map is W x H units in size (1 <= W <= 1000; 1 <= H <= 1000). The map shows where Bessie starts her quest, the single square where the Knights of Ni are, and the locations of all the shrubberies of the land. It also shows which areas of the map can be traverse (some grid blocks are impassable because of swamps, cliffs, and killer rabbits). Bessie can not pass through the Knights of Ni square without a shrubbery. In order to make sure that she follows the map correctly, Bessie can only move in four directions: North, East, South, or West (i.e., NOT diagonally). She requires one day to complete a traversal from one grid block to a neighboring grid block. It is guaranteed that Bessie will be able to obtain a shrubbery and then deliver it to the Knights of Ni. Determine the quickest way for her to do so.

贝茜遇到了一件很麻烦的事：她无意中闯入了森林里的一座城堡，如果她想回家，就必须穿过这片由骑士们守护着的森林．为了能安全地离开，贝茜不得不按照骑士们的要求，在森林寻找一种特殊的灌木并带一棵给他们．当然，贝茜想早点离开这可怕的森林，于是她必须尽快完成骑士们给的任务，贝茜随身带着这片森林的地图，地图上的森林被放入了直角坐标系，并按x,y轴上的单位长度划分成了W×H(1≤W,H≤1000)块，贝茜在地图上查出了她自己以及骑士们所在的位置，当然地图上也标注了她所需要的灌木生长的区域．某些区域是不能通过的（比如说沼泽地，悬崖，以及食人兔的聚居地）．在没有找到灌木之前，贝茜不能通过骑士们所在的那个区域，为了确保她自己不会迷路，贝茜只向正北、正东、正南、正西四个方向移动（注意，她不会走对角线）．她要走整整一天，才能从某块区域走到与它相邻的那块区域．输入数据保证贝茜一定能完成骑士的任务．贝茜希望你能帮她计算一下，她最少需要多少天才可脱离这可怕的地方？

Input

第1行输入2个用空格隔开的整数，即题目中提到的W、H.

接下来输入贝茜持有的地图，每一行用若干个数字代表地图上对应行的地形．第1行描述了地图最北的那一排土地；最后一行描述的则是最南面的．相邻的数字所对应的区域是相邻的．如果地图的宽小于或等于40，那每一行数字恰好对应了地图上的一排土地．如果地图的宽大于40，那每行只会给出40个数字，并且保证除了最后一行的每一行都包含恰好40个数字．没有哪一行描述的区域分布在两个不同的行里．

地图上的数字所对应的地形：

0：贝茜可以通过的空地

1：由于各种原因而不可通行的区域

2：贝茜现在所在的位置

3：骑士们的位置

4：长着贝茜需要的灌木的土地

Output

输出一个正整数D，即贝茜最少要花多少天才能完成骑士们给的任务．

Sample Input

8 4
4 1 0 0 0 0 1 0
0 0 0 1 0 1 0 0
0 2 1 1 3 0 4 0
0 0 0 4 1 1 1 0

INPUT DETAILS:

Width=8, height=4. Bessie starts on the third row, only a few squares away
from the Knights.

Sample Output

HINT

这片森林的长为8，宽为4．贝茜的起始位置在第3行，离骑士们不远．

贝茜可以按这样的路线完成骑士的任务：北，西，北，南，东，东，北，东，东，南，南．她在森林的西北角得到一株她需要的灌木，然后绕过障碍把它交给在东南方的骑士．

从起点和终点各进行一次SPFA，记录各自到达每个灌木处的距离，之后枚举每个灌木位置，求其到起点和终点的最小距离和

 /*by SilverN*/

 #include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 #include<cmath>

 #include<queue>

 using namespace std;

 const int mxn=;

 int w,h;

 int sx1,sy1,sx2,sy2,tx,ty;

 int tar[mxn][],cnt;

 int mp[mxn][mxn];

 int mx[]={,,,-,},

     my[]={,,,,-};

 int dis[mxn][mxn][];

 bool vis[mxn][mxn];

 queue<pair<int,int> >q;

 void BFS(int sx,int sy,int mode){

     dis[sx][sy][mode]=;

     vis[sx][sy]=;

     q.push(pair<int,int>(sx,sy));

     while(!q.empty()){

         int x=q.front().first,y=q.front().second;

         q.pop();

         for(int i=;i<=;i++){

             int nx=x+mx[i],ny=y+my[i];

             if(nx> && nx<=h && ny> && ny<=w)

                 if(!vis[nx][ny] && (mp[nx][ny]== || mp[nx][ny]==)){

                     dis[nx][ny][mode]=dis[x][y][mode]+;

                     vis[nx][ny]=;

                     q.push(pair<int,int>(nx,ny));

                 }

         }

     }

 }

 int main(){

     scanf("%d%d",&w,&h);

     int i,j;

     for(i=;i<=h;i++)

      for(j=;j<=w;j++){

          scanf("%d",&mp[i][j]);

          if(mp[i][j]==)sx1=i,sy1=j;

          if(mp[i][j]==)sx2=i,sy2=j;

          if(mp[i][j]==)tar[++cnt][]=i,tar[cnt][]=j;

      }

     BFS(sx1,sy1,);

     memset(vis,,sizeof vis);

     BFS(sx2,sy2,);

     int ans=0x5fffff;

     for(i=;i<=cnt;i++){

         if(dis[tar[i][]][tar[i][]][]!= && dis[tar[i][]][tar[i][]][]!=)

         ans=min(ans,dis[tar[i][]][tar[i][]][]+dis[tar[i][]][tar[i][]][]);

     }

     printf("%d\n",ans);

     return ;

 }