MAXWOODS  MAXIMUM WOOD CUTTER
Problem Statement:
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.
Input:
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.
Output:
For each test case find the maximum trees that you can cut.
Input Constraints:
1<=t<=10
1<=m,n<=200
Example:
Sample Input:
4 5 5 0TTTT T#T#0 #TT#T T00T0 T0#T0 1 1 T 3 3 T#T TTT T#T 1 1 #
Sample Output:
8 1 3 0
Solution for test case #1:
hide comments
entente888:
20210201 10:09:17
creative problem


karankaira:
20200924 06:44:49
[spoiler] is the best AC in 1 go!! Last edit: 20210127 14:45:22 

s_tank00_:
20200816 18:42:20
@surajxd good Last edit: 20220724 01:58:35 

surajxd:
20200815 09:46:05
just make a [spoiler] Last edit: 20210127 14:45:40 

havokkk:
20200730 00:52:32
AC in 10 tries!!!!!! 

ujjwal_jain10:
20200625 10:52:11
AC in 69th go, yet again.


kelvin_0179:
20200512 11:48:50
for those with [spoiler] ... make sure to check ur code for even rows too.


atharvazzz:
20200415 14:19:24
AC in one go :) 

dkkv0000:
20200125 10:50:08
ac in 1go 

sandeepd:
20191207 19:16:35
IMHO, I believe if you're handling the starting index having '#' separately, you aren't writing code the way it should be. Last edit: 20191207 19:17:14 
Added by:  cegprakash 
Date:  20121014 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 GOSU 
Resource:  Inspired from http://codeforces.com/problemset/problem/115/B 