HDU 2612 Find a way(BFS)

原创 2016年05月30日 17:48:50
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要在KFC约会,地图上有多个KFC,求在哪个KFC两人所走总距离最短,(注意KFC可以当做路)

#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
#define INF 0x3fffffff
char map[201][202];
int vis[202][102];
int dis[202][202][2];
int f[4][2]= {0,1,1,0,-1,0,0,-1};
int n,m,flag;
struct node
{
    int x,y,step;
} pose;
void bfs()
{
    queue<node>Q;
    node q,p;
    vis[pose.x][pose.y]=1;
    Q.push(pose);
    while(!Q.empty())
    {
        q=Q.front();
        Q.pop();
        for(int i=0; i<4; i++)
        {
            p=q;
            p.x+=f[i][0];
            p.y+=f[i][1];

            if(p.x>=0&&p.y>=0&&p.x<n&&p.y<m&&map[p.x][p.y]!='#'&&!vis[p.x][p.y])
            {
                vis[p.x][p.y]=1;
                p.step+=11;
                if(map[p.x][p.y]=='@')
                    dis[p.x][p.y][flag]=p.step;
                Q.push(p);
            }
        }
    }
}
int main()
{
    int i,j;
    while(cin>>n>>m)
    {
        for(i=0; i<n; i++)
            for(j=0; j<m; j++)
                dis[i][j][0]=dis[i][j][1]=INF;
        for(i=0; i<n; i++)
            for(j=0; j<m; j++)
                cin>>map[i][j];
        for(i=0; i<n; i++)
            for(j=0; j<m; j++)
            {
                if(map[i][j]=='Y')
                {
                    pose.x=i;
                    pose.y=j;
                    pose.step=0;
                    flag=0;
                    memset(vis,0,sizeof(vis));
                    bfs();
                }
                else if(map[i][j]=='M')
                {
                    pose.x=i;
                    pose.y=j;
                    pose.step=0;
                    flag=1;
                    memset(vis,0,sizeof(vis));
                    bfs();
                }
            }
        int minn=INF;
        for(i=0; i<n; i++)
            for(j=0; j<m; j++)
                if(map[i][j]=='@'&& minn>dis[i][j][0]+dis[i][j][1])
                    minn=dis[i][j][0]+dis[i][j][1];
        cout<<minn<<endl;
    }
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

HDU 2612 Find a way BFS广搜 且行且珍惜——

Find a way Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit S...

ACM-bfs之Find a way——hdu2612

bfs Find a way hdu2612

HDU Problem 2612 Find a way 【BFS】

Find a way Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tot...

HDU 2612 Find a way BFS

Find a way Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total...

HDU 2612 Find a way(两次BFS)

Problem Description Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. ...

HDU 2612 Find a way BFS 2次广搜

Find a way Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Tot...

hdu-2612-find a way(bfs)

Find a way Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tot...

H - Find a way HDU - 2612 ——2次BFS

Think: 1自己用结构体队列测试数据都对,但是结果错误,一直没有找到错误所在,暂时将问题记录 2借鉴前辈博客,用C++中STl里面的queue队列,与自己之前的思想基本相同,Accepted ...

C语言BFS(4)___Find a way(Hdu 2612)

Problem Description Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally...

HDU2612(Find a way)搜索-两次BFS

/***************************************************** 题目大意: Y和M要在KFC约会,地图上有多个KFC,求在哪个KFC两人所走总距离最短; ...
  • Jarily
  • Jarily
  • 2013年04月13日 18:41
  • 1012
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 2612 Find a way(BFS)
举报原因:
原因补充:

(最多只允许输入30个字)