ICE CAVE(BFS搜索(模拟))

Description

You play a computer game. Your character stands on some level of a multilevel ice cave. In order to move on forward, you need to descend one level lower and the only way to do this is to fall through the ice.

The level of the cave where you are is a rectangular square grid of n rows and m columns. Each cell consists either from intact or from cracked ice. From each cell you can move to cells that are side-adjacent with yours (due to some limitations of the game engine you cannot make jumps on the same place, i.e. jump from a cell to itself). If you move to the cell with cracked ice, then your character falls down through it and if you move to the cell with intact ice, then the ice on this cell becomes cracked.

Let‘s number the rows with integers from 1 to n from top to bottom and the columns with integers from 1 to m from left to right. Let‘s denote a cell on the intersection of the r-th row and the c-th column as (r, c).

You are staying in the cell (r1, c1) and this cell is cracked because you‘ve just fallen here from a higher level. You need to fall down through the cell (r2, c2) since the exit to the next level is there. Can you do this?

Input

The first line contains two integers, n and m (1 ≤ n, m ≤ 500) — the number of rows and columns in the cave description.

Each of the next n lines describes the initial state of the level of the cave, each line consists of m characters "." (that is, intact ice) and "X" (cracked ice).

The next line contains two integers, r1 and c1 (1 ≤ r1 ≤ n, 1 ≤ c1 ≤ m) — your initial coordinates. It is guaranteed that the description of the cave contains character ‘X‘ in cell (r1, c1), that is, the ice on the starting cell is initially cracked.

The next line contains two integers r2 and c2 (1 ≤ r2 ≤ n, 1 ≤ c2 ≤ m) — the coordinates of the cell through which you need to fall. The final cell may coincide with the starting one.

Output

If you can reach the destination, print ‘YES‘, otherwise print ‘NO‘.

Sample Input

Input

4 6X...XX...XX..X..X.......1 62 2

Output

YES

Input

5 4.X.....XX.X......XX.5 31 1

Output

NO

Input

4 7..X.XX..XX..X.X...X..X......2 21 6

Output

YES

如题,每走一步,走过的那个地方变成破碎的冰块,如果你再走就会掉下去,你不能在原地跳动使冰块改变状态,而你最终的目地不只是找到目的地,而且要让它为X然后再次进入

原先我还想着要分情况考虑来着,比如目的地原来是X还是。,然后判断条件就变了,之后又要计数,标不标记又是个问题,又考虑从原点到原点。。。。。。。。。。。

最后一塌糊涂,要考虑的太多,问题就很复杂,其实大可不必,只要将到达那一点的条件加一句地图上该点是否为X,其余的模拟实现,走到一点,那一点就变成X。。。。。。
#include"iostream"
#include"algorithm"
#include"cstring"
#include"cstdio"
#include"queue"
using namespace std;
const int maxn=510;

char a[maxn][maxn];
int m,n, book[maxn][maxn];
int nex[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
int sp,sq,p,q,tp,tq;

struct node
{

    int x;
    int y;

};

int BFS()
{
queue<struct node>que;

struct node c,e,t;
c.x=sp;
c.y=sq;
que.push(c);

while(!que.empty())
{
    e=que.front();

    que.pop();
  for(int k=0;k<=3;k++)
  {
      t.x=e.x+nex[k][0];
      t.y=e.y+nex[k][1];

      if(t.x<0||t.x>=m||t.y<0||t.y>=n)
      continue;

      if(t.x==p&&t.y==q&&a[t.x][t.y]==‘X‘)
     {
        return 1;
     }
   //   continue;

  //    book[t.x][t.y]=1;
     if(a[t.x][t.y]==‘X‘)
     continue;
      a[t.x][t.y]=‘X‘;
      que.push(t);

  }
}

return 0;

}

int main()
{
    while(cin>>m>>n&&m)
    {
      for(int i=0;i<m;i++)
      {
       scanf("%s",a[i]);
      }
      memset(book,0,sizeof(book));

      cin>>sp>>sq;
      cin>>p>>q;

       sp=sp-1;
       sq=sq-1;
       p=p-1;
       q=q-1;

       if(BFS()) cout<<"YES"<<endl;
       else cout<<"NO"<<endl;

    }
return 0;
}
时间: 2024-10-23 20:01:22

ICE CAVE(BFS搜索(模拟))的相关文章

CF #301 504C C. Ice Cave BFS

C. Ice Cave time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You play a computer game. Your character stands on some level of a multilevel ice cave. In order to move on forward, you need to

C. Ice Cave (CF #301 (Div. 2) 搜索bfs)

C. Ice Cave time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You play a computer game. Your character stands on some level of a multilevel ice cave. In order to move on forward, you need to

DFS/BFS Codeforces Round #301 (Div. 2) C. Ice Cave

题目传送门 1 /* 2 题意:告诉起点终点,踩一次, '.'变成'X',再踩一次,冰块破碎,问是否能使终点冰破碎 3 DFS:如题解所说,分三种情况:1. 如果两点重合,只要往外走一步再走回来就行了:2. 若两点相邻, 4 那么要不就是踩一脚就破了或者踩一脚走开再走回来踩一脚破了:3. 普通的搜索看是否能到达, 5 若能还是要讨论终点踩几脚的问题:) 6 DFS 耗时大,险些超时,可以用BFS来做 7 */ 8 #include <cstdio> 9 #include <algorit

CodeForces 540C Ice Cave (BFS)

http://codeforces.com/problemset/problem/540/C Ice Cave Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 540C Description You play a computer game. Your character stands on some level of

ice cave

Description You play a computer game. Your character stands on some level of a multilevel ice cave. In order to move on forward, you need to descend one level lower and the only way to do this is to fall through the ice. The level of the cave where y

(简单广搜) Ice Cave -- codeforces -- 540C

http://codeforces.com/problemset/problem/540/C You play a computer game. Your character stands on some level of a multilevel ice cave. In order to move on forward, you need to descend one level lower and the only way to do this is to fall through the

poj 1915 Knight Moves (bfs搜索)

Knight Moves Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 21919   Accepted: 10223 Description Background Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast

2020腾讯笔试--Ice Cave

链接:http://codeforces.com/contest/540/problem/C You play a computer game. Your character stands on some level of a multilevel ice cave. In order to move on forward, you need to descend one level lower and the only way to do this is to fall through the

hiho_1139_二分+bfs搜索

题目 给定N个点和M条边,从点1出发,寻找路径上边的个数小于等于K的路径,求出所有满足条件的路径的路径中最长边长度的最小值. 题目链接:二分     最小化最大值,考虑采用二分搜索.对所有的边长进行排序,二分,对每次选择的边长,判断是否存在一条路径满足路径上所有的边长度均小于等于该边长,且路径中的边的个数小于等于K.     在判断路径是否存在的时候,使用BFS搜索,因为BFS用于寻找最短(边的个数最少)路径. 实现 #include<stdio.h> #include<string.h