WA Long & Narrow Maze

yellowAgony 2010-01-23 07:28:02 UTC #1

I am getting consistently wa. My approach is simple -for every cell I have 4 states that represent which direction you reach this cell from & based on type of cell , I decide which all states are neighbours of any state. I then do a simple bfs.

Could anyone point out the mistake in the approach or give some test cases ?
Thanks.

avm1 2020-12-26 15:14:07 UTC #2

BFS approach is fine, but it should be carefully implemented.
This test with correct answer no, help me get AC for this tricky problem.
1
4
1 0 0
1 2 2
2 1 2
0 1 0