Codeforces E. Two Labyrinths ( BFS

原创于 2017-03-26 23:40:27 发布 · 809 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

online judge CodeForces

搜索 DFS/BFS

本文介绍了一个关于迷宫最短路径的算法问题，通过三次宽度优先搜索（BFS），判断两个迷宫是否存在从左上角到右下角的相同长度的最短路径。文章详细展示了如何使用BFS算法来解决这一问题，并给出了具体的实现代码。

E. Two Labyrinths

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A labyrinth is the rectangular grid, each of the cells of which is either free or wall, and it’s possible to move only between free cells sharing a side.

Constantine and Mike are the world leaders of composing the labyrinths. Each of them has just composed one labyrinth of size n × m, and now they are blaming each other for the plagiarism. They consider that the plagiarism takes place if there exists such a path from the upper-left cell to the lower-right cell that is the shortest for both labyrinths. Resolve their conflict and say if the plagiarism took place.

Input

In the first line two integers n and m (1 ≤ n, m ≤ 500) are written — the height and the width of the labyrinths.

In the next n lines the labyrinth composed by Constantine is written. Each of these n lines consists of m characters. Each character is equal either to «#», which denotes a wall, or to «.», which denotes a free cell.

The next line is empty, and in the next n lines the labyrinth composed by Mike is written in the same format. It is guaranteed that the upper-left and the lower-right cells of both labyrinths are free.

Output

Output «YES» if there exists such a path from the upper-left to the lower-right cell that is the shortest for both labyrinths. Otherwise output «NO».

Examples

Input

3 5
.....
.#.#.
.....
  

.....
#.#.#
.....

Output

NO

Input

3 5
.....
.#.##
.....
  

.....
##.#.
.....

Output

YES

3个BFS板子题菜的难受

#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
#define N 1000
char s1[N][N], s2[N][N];
bool vis[N][N];
int m, n;
int dir[4][2] = {0,-1,-1,0,1,0,0,1};
struct node{
    int x, y, step;

}now,next;
bool judge(int x,int y)
{
    if(x>=0 && x<n && y>=0 && y<m)  return true;
    else return false;
}
int bfs(char map[N][N])
{
    queue<node> q;
    memset(vis,false,sizeof(vis));
    now.x = 0, now.y = 0, now.step = 0;
    q.push(now);
    vis[0][0] = true;
    while(!q.empty()) {
        now = q.front();
        q.pop();
        if(now.x==n-1 && now.y==m-1) return now.step;
        int x = now.x; int y = now.y;
        for(int i = 0;i < 4; i++) {
            int xx = x + dir[i][0];
            int yy = y + dir[i][1];
            if(judge(xx,yy) && !vis[xx][yy] && map[xx][yy]!='#') {
                next.x = xx;
                next.y = yy;
                next.step = now.step+1;
                vis[xx][yy] = true;
                q.push(next);
            }
        }
    }
    return -1;
}

int main()
{
    bool flag = true;
    scanf("%d%d",&n,&m);
    for(int i = 0;i < n; i++) 
        scanf("%s",s1[i]); 
    for(int i = 0;i < n; i++)
        scanf("%s",s2[i]);
    int ans_1 = bfs(s1);
    int ans_2 = bfs(s2);
    if((ans_1 != ans_2)||(ans_1 == ans_2&&ans_1==-1)) {
        flag = false;
    }
    for(int i = 0;i < n; i++) {
        for(int j = 0;j < m; j++) {
            if(s1[i][j]=='.' && s2[i][j]=='#') s1[i][j] = '#';
        }
    } 
    int ans = bfs(s1);
    if(ans != ans_1) flag = false;
    if(flag) puts("YES");
    else puts("NO");

return 0;
}