87 227
Assignments Done
98.5%
Successfully Done
In May 2020

# Answer to Question #47318 in Java | JSP | JSF for Himal Mistry

Question #47318
Given a square maze (A) of dimension N, every entry (Aij) in the maze is either an open cell 'O' or a wall 'X'. A rat can travel to its adjacent locations (left, right, top and bottom), but to reach a cell, it must be open. Given the locations of R rats, can you find out whether all the rats can reach others or not? Input Format: Input will consist of three parts, viz. 1. Size of the maze (N) 2. The maze itself (A = N * N) 3. Number of rats (R) 4. Location of R rats (Xi, Yi) Note: (Xi,Yi) will represents the location of the i-th rat. Locations are 1-index based. Output Format: Print &quot;Yes&quot; if the rats can reach each other, else print &quot;No&quot; Constraints: 1&lt;=N&lt;=350 Aij = {'O','X'} 1&lt;=R&lt;=N*N 1&lt;=Xi&lt;=N 1&lt;=Yi&lt;=N
0

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

LATEST TUTORIALS
New on Blog
APPROVED BY CLIENTS