-
Notifications
You must be signed in to change notification settings - Fork 0
/
maxwoods.cpp
77 lines (73 loc) · 1.47 KB
/
maxwoods.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#include<bits/stdc++.h>
using namespace std;
long long m,n,mat[205][205];
long long dp[205][205];
bool isvalid(long long i,long long j)
{
if(i<=m && i>=1 && j>=1 && j <=n)
return true;
return false;
}
long long rec(long long i,long long j)
{
long long p1,p2;
if(isvalid(i,j)==false)
{
//cout<<"yes";
return 0;
}
if(mat[i][j]==-1)
{
//cout<<"yes11";
dp[i][j]=0;
cout<<" i is "<<i<<" j is "<<j<<" dp is "<<dp[i][j]<<"\n";
return dp[i][j];
}
if(dp[i][j]!=-1)
return dp[i][j];
if(i%2!=0)
{
p1=rec(i,j+1);
p2=rec(i+1,j);
}
else
{
p1=rec(i,j-1);
p2=rec(i+1,j);
}
if(mat[i][j]==1)
dp[i][j]=max(p1,p2)+1;
if(mat[i][j]==0)
dp[i][j]=max(p1,p2);
cout<<" i is "<<i<<" j is "<<j<<" dp is "<<dp[i][j]<<"\n";
return dp[i][j];
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin>>t;
while(t--)
{
long long i,j;
char x;
for(i=0;i<205;i++)
for(j=0;j<205;j++)
dp[i][j]=-1;
cin>>m>>n;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
cin>>x;
if(x=='T')
mat[i][j]=1;
if(x=='#')
mat[i][j]=-1;
if(x=='0')
mat[i][j]=0;
}
cout<<rec(1,1);
cout<<dp[1][1]<<"\n";
}
}