Ice Cave（BFS）

原题链接
C. Ice Cave
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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?

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’.

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.

这个题由于有的时候需要走过去后再走回来，但是他有一个走过去后不能走回来的特点，且由于矩阵巨大，不能用DFS，但是BFS就可以，而且这个BFS很经典

#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
const int maxn=503;
typedef struct node{
        int x,y;
}node;
char a[maxn][maxn];
int vis[maxn][maxn];
int n,m,qx,qy,zx,zy;
int fx[4]={-1,1,0,0};
int fy[4]={0,0,-1,1};
bool can(int x,int y){
        if(x==zx && y==zy) return true;//不管有没有走过终点，终点绝对是可以走的
        if(vis[x][y] == -1 && a[x][y] != 'X') return true;
        else return false;
}
void bfs(){
        memset(vis,-1,sizeof(vis));
        queue<node> q;
        node t;
        t.x=qx;t.y=qy;
        q.push(t);
        vis[t.x][t.y]=0;
        while(!q.empty()){
                node now=q.front();
                q.pop();
                for(int i=0;i<4;i++){
                        node newx;
                        newx.x = now.x + fx[i]; newx.y = now.y + fy[i];
                        if(newx.x>=1 && newx.x<=n && newx.y>=1 && newx.y<=m){
                                if(can(newx.x,newx.y)){//还有一个教训就是事先不把所有的情况想好以及判断条件想好，那么后期是很容易错的
                                        if(newx.x==zx && newx.y==zy && (a[newx.x][newx.y]=='X' || vis[newx.x][newx.y]!=-1)){//想要输出要么是终点本身就是X,要么走过终点一次
                                                printf("YES\n");
                                                return;
                                        }
                                        vis[newx.x][newx.y] = vis[now.x][now.y]+1;
                                        q.push(newx);
                                }
                        }
                }
        }
        printf("NO\n");
        return;
}
int main(){
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
                for(int j=1;j<=m;j++)
                        cin >> a[i][j];
        cin >> qx >> qy >> zx >> zy;
        bfs();
        return 0;
}