Scribd
Upload
2 views2 pages

Problem - B - Codeforces

The document describes a problem where Vivek needs to navigate a maze represented as an n × m grid, containing empty cells, walls, good people, and bad people. The goal is to determine if it's possible to block some empty cells with walls so that all good people can escape while preventing bad people from escaping, with multiple test cases provided. The output for each test case is either 'Yes' or 'No' based on the feasibility of this arrangement.

Uploaded by

Thuan Nguyen Hoa
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

Problem - B - Codeforces

The document describes a problem where Vivek needs to navigate a maze represented as an n × m grid, containing empty cells, walls, good people, and bad people. The goal is to determine if it's possible to block some empty cells with walls so that all good people can escape while preventing bad people from escaping, with multiple test cases provided. The output for each test case is either 'Yes' or 'No' based on the feasibility of this arrangement.

Uploaded by

Thuan Nguyen Hoa
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

tcreepervn | Logout

PROBLEMS SUBMIT CODE MY SUBMISSIONS STATUS STANDINGS CUSTOM INVOCATION

B. Solve The Maze


time limit per test: 1 second
memory limit per test: 256 megabytes

Vivek has encountered a problem. He has a maze that can be represented as an n × m grid. Each of the grid cells may represent the
following:

Empty — '.'
Wall — '#'
Good person — 'G'
Bad person — 'B'

The only escape from the maze is at cell (n, m).

A person can move to a cell only if it shares a side with their current cell and does not contain a wall. Vivek wants to block some of the
empty cells by replacing them with walls in such a way, that all the good people are able to escape, while none of the bad people are
able to. A cell that initially contains 'G' or 'B' cannot be blocked and can be travelled through.

Help him determine if there exists a way to replace some (zero or more) empty cells with walls to satisfy the above conditions.

It is guaranteed that the cell (n, m) is empty. Vivek can also block this cell.

Input
The first line contains one integer t (1 ≤ t ≤ 100) — the number of test cases. The description of the test cases follows.

The first line of each test case contains two integers n, m (1 ≤ n, m ≤ 50) — the number of rows and columns in the maze.

Each of the next n lines contain m characters. They describe the layout of the maze. If a character on a line equals '.', the
corresponding cell is empty. If it equals '#', the cell has a wall. 'G' corresponds to a good person and 'B' corresponds to a bad person.

Output
For each test case, print "Yes" if there exists a way to replace some empty cells with walls to satisfy the given conditions. Otherwise
print "No"

You may print every letter in any case (upper or lower).

Example
input Copy

6
1 1
.
1 2
G.
2 2
#B
G.
2 3
G.#
B#.
3 3
#B.
#..
GG.
2 2
#B
B.
 output Copy

Yes
Yes
No
No
Yes
Yes

Note
For the first and second test cases, all conditions are already satisfied.

For the third test case, there is only one empty cell (2, 2) , and if it is replaced with a wall then the good person at (1, 2) will not be able
to escape.

For the fourth test case, the good person at (1, 1) cannot escape.

For the fifth test case, Vivek can block the cells (2, 3) and (2, 2) .

For the last test case, Vivek can block the destination cell (2, 2) .

Codeforces (c) Copyright 2010-2026 Mike Mirzayanov


The only programming contests Web 2.0 platform
Server time: Mar/28/2026 09:03:38UTC+7 (g1).
Mobile version, switch to desktop version.
Privacy Policy | Terms and Conditions

Supported by

You might also like