ACM-steps--4.2.6--Find a way

最新推荐文章于 2023-03-25 21:22:01 发布

木土的H

最新推荐文章于 2023-03-25 21:22:01 发布

阅读量463

点赞数

分类专栏：基础搜索文章标签：基础题数字搜索

本文链接：https://blog.csdn.net/wyx13109395842/article/details/44204855

版权

基础同时被 2 个专栏收录

141 篇文章 0 订阅

订阅专栏

搜索

16 篇文章 0 订阅

订阅专栏

Find a way

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 159 Accepted Submission(s): 63

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

Author

yifenfei

Source

奋斗的年代

Recommend

yifenfei

#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
char map[209][209];//用于地图的输入。
int y_step[209][209];
int m_step[209][209];//用于记录y和m到达每一步所用的最小的步数；
int step[209][209];
//求解两人到达同一个地方，且两人都可以移动，求出两人分别到达每一个每一个目的地所用的最短路;
//相加求出时间，然后枚举出最短的时间。
int vis[209][209];//访问的状态来那个。
int y_curx,y_cury,m_curx,m_cury;//记录两个人最开始的坐标.
int n,m;//表示行列。
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
struct dyx
{
    int x,y;
};
int wyx(int x,int y)
{
    if(x<0||x>n||y<0||y>m||vis[x][y]||map[x][y]=='#')
    return 1;
    return 0;
}
int bfs(int now_x,int now_y)
{
    queue<dyx> que;
    dyx now,next;
    now.x=now_x;
    now.y=now_y;
    memset(vis,0,sizeof(vis));
    vis[now_x][now_y]=1;
    step[now_x][now_y]=0;
    que.push(now);
    while(!que.empty())
    {
        now=que.front();
        que.pop();
        for(int i=0;i<4;i++)
        {
            next=now;
            next.x+=dx[i];
            next.y+=dy[i];
            if(wyx(next.x,next.y))
            continue;
            step[next.x][next.y]=step[now.x][now.y]+1;
            vis[next.x][next.y]=1;
            que.push(next);
        }
    }
    return 0;
}
int main()
{
    //int i,j;
    while(cin>>n>>m)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                cin>>map[i][j];
                //首先寻找y和m的初始位置.
                if(map[i][j]=='Y')
                {
                    y_curx=i;
                    y_cury=j;
                }
                else if(map[i][j]=='M')
                {
                    m_curx=i;
                    m_cury=j;
                }
            }
        }
        int mmin=99999999;
        bfs(y_curx,y_cury);
        for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            y_step[i][j]=step[i][j];
        }
        bfs(m_curx,m_cury);
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                m_step[i][j]=step[i][j];
            }
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                step[i][j]=y_step[i][j]+m_step[i][j];
                if(map[i][j]=='@')
                {
                    if(mmin>step[i][j])
                    mmin=step[i][j];
                }
            }
        }
        cout<<mmin*11<<endl;//经过每一个格子都会耗费11分钟;
    }
    return 0;
}