BFS 학습 Codeforces 301div.2

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
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
typedef long long LL;
typedef pair 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 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

이 내용에 흥미가 있습니까?

현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:

다양한 언어의 JSON

JSON은 Javascript 표기법을 사용하여 데이터 구조를 레이아웃하는 데이터 형식입니다. 그러나 Javascript가 코드에서 이러한 구조를 나타낼 수 있는 유일한 언어는 아닙니다. 저는 일반적으로 '객체'{}...

텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.

CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.

BFS 학습 Codeforces 301div.2_Ice Cave

좋은 웹페이지 즐겨찾기