ALLIZWEL - ALL IZZ WELL
ALL IZZ WELL
Mr.ESP used to tell “ALL IZZ WELL” whenever he gets into any trouble. So his friends and the people around him used to laugh at him. But Mr.ESP is very strong in his belief. He believes that the term “ALL IZZ WELL” will make everything fine. Now your task is to ignore the story above and find whether there is a path in the given matrix which makes the sentence “ALL IZZ WELL”
There is a path from any cell to all its neighbouring cells. A neighbour may share an edge or a corner.
The first line consists of an integer t representing the number of test cases.
The first line of each test case consists of two integers R and C representing the number of rows and number of columns in the matrix. The description of the matrix follows.
For each test case print “YES” if there is a path which makes the sentence “ALLIZZWELL”. Else print “NO”.
Note: Take care of 4th test case
There is a new line after every test case in the input.
t <= 1000
R <= 100
C <= 100
5 3 6 AWE.QX LLL.EO IZZWLL 1 10 ALLIZZWELL 2 9 A.L.Z.E.. .L.I.W.L. 3 3 AEL LWZ LIZ 1 10 LLEWZZILLASample Output:
YES YES NO NO YES
AC in one go :))
Okay this was the first time that o/p format cost me 3 WA :( ...though an easy problem if u know backtracking! :D
basic [SPOILER] :-)Last edit: 2016-12-28 19:02:45
Try these test cases ...
accepted in one go :)
Once you choose a path to follow, you can't go backwards. Pretty straightforward, AC in one.Last edit: 2016-08-08 03:59:27
1. No letter can be retraversed.
using backtrack, Java time limit, C++ AC with 0.02s. ???
very easy. AC in one go!
Please help, getting wrong answer!! here is my code link: http://ideone.com/CuW2hT