Given a forest represented m-by-n grid. You are in grid[sx][sy] and want to reach grid[tx][ty].\n\nConstrains:\n(1) Some cells contain lions grid[i][j]=1\n(2) Other cells are empty grid[i][j]=0\n(3) Lion kills if we visit cell with lion. The farther from the lion you are, the safer you are.\nFind the shortest and safest path from grid[sx][sy] to grid[tx][ty] by travelling farthest from lion cells.\nAlso tell the minimum ever distance between you and a lion in that path.\n\n(I thought about Binary Search for safest distance from lion)

Given a forest represented m-by-n grid. You are in grid[sx][sy] and want to reach grid[tx][ty].\n\nConstrains:\n(1) Some cells contain lions grid[i][j]=1\n(2) O