5238: Ice Cave冰穴

内存限制:256 MB 时间限制:2 S 标准输入输出
题目类型:传统 评测方式:文本比较 上传者:
提交:3 通过:3

题目描述

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 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?

你玩电脑游戏。你的角色站在多层冰洞的某个层面上。为了继续前进,您需要降低一层,唯一的方法就是从冰上掉下来。

您所在的洞穴水平是一个由 n 行和 m 列组成的矩形方形网格。每个细胞要么由完整的冰组成,要么来自裂开的冰。从每个单元格中,您可以移动到与您的单元格侧面相邻的单元格(由于游戏引擎的某些限制,您无法在同一个地方进行跳跃,即从单元格跳到自身)。如果你移动到有裂冰的牢房,那么你的角色就会从里面掉下来,如果你移动到有完整冰块的牢房,那么这个牢房上的冰就会破裂。

让我们从上到下对整数从 1 到 n 的行和从左到右从 1 到 m 的整数的列进行编号。让我们将 r 行和第 c 列交点上的单元格表示为 (r, c)。

你呆在牢房里(r1, c1)这个细胞被破解了,因为你刚刚从更高的层次掉到这里。你需要从牢房里掉下来(r2, c2)因为下一个级别的出口就在那里。你能做到吗?


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≤r1n,1≤c1m)− 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≤r2n,1≤c2m)− 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'.
Examples
Input
4 6
X...XX
...XX.
.X..X.
......
1 6
2 2
Output
YES
Input
5 4
.X..
...X
X.X.
....
.XX.
5 3
1 1
Output
NO
Input
4 7
..X.XX.
.XX..X.
X...X..
X......
2 2
1 6
Output
YES
Note
In the first sample test one possible path is:

After the first visit of cell (2,2) the ice on it cracks and when you step there for the second time, your character falls through the ice as intended.

输入样例 复制


输出样例 复制