zoukankan      html  css  js  c++  java
  • hdu2612 Find a way

    Problem 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
    BFS
    #include<iostream>
    #include<queue>
    #include<cstring>
    using namespace std;
    int m,n;
    int vis[210][210];
    char mapp[210][210];
    int dis[210][210][2];
    int dir[4][2] = {1,0,0,1,-1,0,0,-1},flag;
    struct node{
        int x;
        int y;
        int step;
    }; 
    bool judge(int x,int y)
    {
        if(x>=0&&x<m&&y>=0&&y<n&&mapp[x][y]!='#'&&vis[x][y]==0)
        return 1;
        return 0;
    }
    int BFS(int x,int y)
    {
        queue<node>q;
        node now,next;
        now.x=x;
        now.y=y;
        now.step=0;
        vis[x][y]=1;
        q.push(now);
        while(!q.empty())
        {
            now=q.front();
            q.pop();
            next.step=now.step+1;
            for(int i=0;i<4;i++)
            {
                next.x=now.x+dir[i][0];
                next.y=now.y+dir[i][1];
                if(judge(next.x,next.y))
                {
                    vis[next.x][next.y]=1;
                    if(mapp[next.x][next.y]=='@')
                    dis[next.x][next.y][flag]=next.step;
                    q.push(next);
                }
            }
        }
    }
    int main()
    {
        while(cin>>m>>n)
        {
            int min=9999999;
            for(int i=0;i<m;i++)
               for(int j=0;j<n;j++)
                   dis[i][j][0]=dis[i][j][1]=min;
            for(int i=0;i<m;i++)
            for(int j=0;j<n;j++)
            {
                cin>>mapp[i][j];
            }
            for(int i=0;i<m;i++)
            for(int j=0;j<n;j++)
            {
                if(mapp[i][j]=='Y')
                {
                    flag=0;
                    memset(vis,0,sizeof(vis));
                    BFS(i,j);
                }
                else if(mapp[i][j]=='M')
                {
                    flag=1;
                    memset(vis,0,sizeof(vis));
                    BFS(i,j);
                } 
            }
            for(int i=0;i<m;i++)
               for(int j=0;j<n;j++)
                   if(mapp[i][j]=='@' && min>dis[i][j][0]+dis[i][j][1])
                       min=dis[i][j][0]+dis[i][j][1];
               printf("%d
    ",min*11); 
        }
    }
  • 相关阅读:
    PHP实反向代理-收藏
    微信小程序实例-获取当前的地理位置、速度
    Entity Framework Core 实现读写分离
    将ASP.NET Core应用程序部署至生产环境中(CentOS7)(转)
    Centos 7防火墙firewalld开放80端口
    Asp.net Core 使用Redis存储Session
    .net core 使用Autofac依赖注入
    .net core 1.0 实现负载多服务器单点登录
    用ASP.NET Core 1.0中实现邮件发送功能-阿里云邮件推送篇
    阿里大鱼.net core 发送短信
  • 原文地址:https://www.cnblogs.com/wangmenghan/p/5565686.html
Copyright © 2011-2022 走看看