Hey how to solve this problem? Thanks in Advance
Take a linear DP array which you’ll use as a table.
Instead of taking a boolean visited array, take an integer array and store a unique number for each DFS search.
Use this index to refer to DP array whenever you encounter a query which is already visited.
ans = dfs(a, b);
dp[idx] = ans;
", dp[ vis[a] ]);
You can also use a Union-Find Data Structure.
The problem asks u to find the number of pictures(maximum) he can see for the given k starting positions.
So for now leave the k queries and solve the problem.
Approach:1) start iterating the museum and whenever u encounter an empty cell perform dfs if it is not visited and count the pictures he can see and the answer will be the same for all the empty cells we get in the path of dfs.
void dfs(int a,int b)
Now in checker function we add the answer of the pictures.
void checker(int a,int b)
if (museum[a]**=='*') ++C; else dfs(a,b);
Here C is the maximum pictures he can see and it is same for all the empty cells in that component.
Now we have the answer for all the cells as starting point so for each query just output the answer .
U need to simply apply dfs from the starting point given in the query if u dont have its answer precalculated…now the recurrence for dp could be like
dp[x][y]+=1 …if adjacent child is ‘*’ or
“Now answer for all the nodes visited in dfs will be equal to dp[x][y]”,this is because if u can visit child_x and child_y from x and y and see dp[x][y] pictures then you can also see dp[x][y] pictures if you start your journey from child_x and child_y…
To implement this simply take a vector of pair…push all the nodes visited in this vector and do something like this…
Now print the value of dp[x][y]…!!
I think it would be appropriate to put the full name of the problem in the question title. It may help someone searching for it in the future.