[kuangbin带你飞]专题一 简单搜索N - Find a way(HDU 2612)

N - Find a way

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

Submit  Status  Practice  HDU 2612

Appoint description:  System Crawler  (2015-11-09)

Description

Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki. 
Yifenfei’s home is at the countryside, but Merceki’s home is in the center of city. So yifenfei made arrangements with Merceki to meet at a KFC. There are many KFC in Ningbo, they want to choose one that let the total time to it be most smallest. 
Now give you a Ningbo map, Both yifenfei and Merceki can move up, down ,left, right to the adjacent road by cost 11 minutes. 

 

Input

The input contains multiple test cases. 
Each test case include, first two integers n, m. (2<=n,m<=200). 
Next n lines, each line included m character. 
‘Y’ express yifenfei initial position. 
‘M’    express Merceki initial position. 
‘#’ forbid road; 
‘.’ Road. 
‘@’ KCF 

 

Output

For each test case output the minimum total time that both yifenfei and Merceki to arrival one of KFC.You may sure there is always have a KFC that can let them meet.

 

Sample Input

       
       

        
        4 4
Y.#@
....
.#..
@..M
4 4
Y.#@
....
.#..
@#.M
5 5
Y..@.
.#...
.#...
@..M.
#...#
        
        
       
       

 

Sample Output

       
       

        
        66
88
66 
       
       

 

题意：Y和M到达同一个@的时间最短的时间。

求最短距离用bfs

vis初始化为无限大

对Y bfs求到所有@的最短距离 记录到vis[0][][]数组中

对M bfs求到所有@的最短距离 记录到vis[1][][]数组中

在求到@最短的时间。

#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
using namespace std;

const int N = 222;
char str[N][N];
int n, m;
struct node
{
    int x, y;
    node(){}
    node(int xx, int yy)
    {
        x = xx; y = yy;
    }
};

int vis[2][N][N];
int dir[5][2] = { {1, 0}, {-1, 0}, {0, 1}, {0, -1} };
queue
       
       
         que; void bfs(node star, int cnt) { while(!que.empty()) que.pop(); que.push( star ); vis[cnt][star.x][star.y] = 0; while(!que.empty()) { node tmp = que.front(); que.pop(); // printf("tmp.x=%d \t tmp.y=%d tmp.val=%d\n", tmp.x, tmp.y, vis[cnt][tmp.x][tmp.y]); int x, y; for(int i = 0; i < 4; i++) { x = tmp.x + dir[i][0]; y = tmp.y + dir[i][1]; if(0 <= x && x < n && 0 <= y && y < m && (str[x][y] == '.' || str[x][y] == '@') && vis[cnt][x][y] == N*N*N) { vis[cnt][x][y] = vis[cnt][tmp.x][tmp.y]+1; que.push( node(x, y) ); // printf("\t x=%d \t y=%d \t vis[cnt][x][y]=%d\n", x, y, vis[cnt][x][y]); } } } } int main(void) { while(~scanf("%d%d", &n, &m)) { int i, j; node star1, star2; for(i = 0; i < n; i++) { scanf("%s", str[i]); for(j = 0; str[i][j]; j++) { if(str[i][j] == 'Y') { star1 = node(i, j); } if(str[i][j] == 'M') { star2 = node(i, j); } vis[0][i][j] = vis[1][i][j] = N*N*N; } } bfs(star1, 0); bfs(star2, 1); int ans = N*N*N; for(i = 0; i < n; i++) { for(j = 0; j < m; j++) { if(str[i][j] == '@') ans = min(ans, vis[0][i][j]+vis[1][i][j]); } } printf("%d\n", ans*11); } return 0; }