BFS学习 Codeforces 301_div.2_Ice Cave

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?

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

链接：http://codeforces.com/contest/540/problem/C

这题就是bfs，感觉有点区别的地方有陷阱，一般的地方踩过一次之后也会变成陷阱

#include<iostream>
#include<cmath>
#include<cctype>
#include<stack>
#include<queue>
#include<cstring>
#include<sstream>
#include<cstdlib>
#include<map>
#include<deque>
#include<set>
#include<utility>
#include<vector>
#include<algorithm>
#include<cstdio>
using namespace std;
typedef long long LL;
typedef pair<int, int> P; 
#define lson k<<1, L, mid
#define rson k<<1|1, mid+1, R
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define Mant 0x3f3f3f3f
#define Mint -0x3f3f3f3f
#define N 510
int dx[]={ 1, -1, 0, 0 };  
int dy[]={ 0, 0, 1, -1 };  

int n,m;
int r1,c1,r2,c2;
char graph[N][N];
 
bool bfs(){
	queue<P> q;
	q.push(P(r1,c1));
	graph[r1][c1]='X'; //第一步上去冰块已碎 
	while(!q.empty()){
		r1=q.front().first; c1=q.front().second; q.pop(); 
		for(int i=0;i<4;i++){
			int xx=r1+dx[i];
			int yy=c1+dy[i];
			if( xx<0 || xx>=n || yy<0 || yy>=m) continue;
			if(graph[xx][yy]=='X'){  //到达点肯定也碎 
				if(xx==r2 && yy==c2) return true;
				continue;
			}
			graph[xx][yy]='X'; //走了之后就变吃呢个易碎的冰块 
			q.push(P(xx,yy));
		}
	}
	return false;
} 
 
int main(){
	while(~scanf("%d %d",&n,&m)){
		for(int i=0;i<n;i++)
		    scanf("%s",graph[i]);
        scanf("%d %d %d %d",&r1,&c1,&r2,&c2);
        r1--;c1--;r2--;c2--;
        printf("%s
",bfs()? "YES" : "NO");
	}
	return 0;
}