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
Archit Mittal: 2014-04-17 09:55:41

can somebody give a tricky test case as i am getting WA after 5th judge
EDIT:Got AC

Last edit: 2012-10-22 14:39:05
:D: 2014-04-17 09:55:41

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.

See here for an example:
http://www.spoj.pl/problems/BABTWR/

If you have problems with submitting images to SPOJ, please contact me via e-mail and will sort it out.

Last edit: 2012-10-18 21:12:49
Aman Gupta: 2014-04-17 09:55:41

Nice question, is BFS supposed to TLE?

Reply : Yes

Aman: Can you tell me the expected complexity to solve this question?

Reply: No. Because there may be many solutions for this problem. But the hint lies in the input constraints.

;)

Last edit: 2012-10-20 13:55:37

Added by:cegprakash
Date:2012-10-14
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