MAXWOODS - MAXIMUM WOOD CUTTER
The image explains it all. You initially step at 0,0 facing right. At each step you can move according to the conditions specified in the image. You cannot step into the blocked boxes (in blue). Find the maximum number of trees you can cut.
The first line consists of an integer t, the number of test cases. For each test case the first line consists of two integers m and n, the number of rows and columns. Then follows the description of the matrix M.
M[i][j]=’T’ if the region has a tree.
M[i][j]=’#’ if the region is blocked.
M[i][j]=’0’ (zero) otherwise.
For each test case find the maximum trees that you can cut.
4 5 5 0TTTT T#T#0 #TT#T T00T0 T0#T0 1 1 T 3 3 T#T TTT T#T 1 1 #
8 1 3 0
Solution for test case #1:
can somebody give a tricky test case as i am getting WA after 5th judge
Nice work on the images. Could you put them on SPOJ, since missing images are a plague here. Pictures from places like dropbox will evaporate sooner or later.
Nice question, is BFS supposed to TLE?