Python program for Forest Fire problem

December 16, 2021

Forest Fire problem

This is one of the problem that was asked in the TCS Codevita 2020 Coding Competition. Here in this article, you will find a Python Solution for the Forest Fire Problem. We have tried to optimize the solution so that you can achieve the best results in the exams.

Problem Statement

Roco is an island near Africa which is very prone to forest fire. Forest fire is such that it destroys the complete forest. Not a single tree is left.This island has been cursed by God , and the curse is that whenever a tree catches fire, it passes the fire to all its adjacent tree in all 8 directions,North, South, East, West, North-East, North-West, South-East, and South-West.And it is given that the fire is spreading every minute in the given manner, i.e every tree is passing fire to its adjacent tree.Suppose that the forest layout is as follows where T denotes tree and W denotes water.

Your task is that given the location of the first tree that catches fire, determine how long would it take for the entire forest to be on fire. You may assume that the lay out of the forest is such that the whole forest will catch fire for sure and that there will be at least one tree in the forest

Input Format:

  • First line contains two integers, M, N, space separated, giving the size of the forest in terms of the number of rows and columns respectively.
  • The next line contains two integers X,Y, space separated, giving the coordinates of the first tree that catches the fire.
  • The next M lines, where ith line containing N characters each of which is either T or W, giving the position of the Tree and Water in the  ith row of the forest.

Output Format:

Single integer indicating the number of minutes taken for the entire forest to catch fire

Constrains:

  • 3 ≤ M ≤ 20
  • 3 ≤ N ≤ 20

 

Sample Input 1:

3 3
W T T
T W W
W T T
Sample Output 1:

5

Explanation:
In the second minute,tree at (1,2) catches fire,in the third minute,the tree at (2,1) catches fire,fourth minute tree at (3,2) catches fire and in the fifth minute the last tree at (3,3) catches fire.
Sample Input 2:
6 6
1 6
W T T T T T
T W W W W W
W T T T T T
W W W W W T
T T T T T T
T W W W W W

Sample Output 2:

16

Python Code for Forest Fire Problem

#Using recursion 
M,N = list(map(int,input().split()))
irow,icol = list(map(int,input().split()))
forest=[]
for i in range(M):
forest.append(list(input().split()))

TimeMat = [[0 for i in range(M)] for j in range(N)]

def countTime(row,col,currtime):
if row<0 or row>M-1 or col<0 or col>N-1:
return
if forest[row][col]=='W':
return
if TimeMat[row][col]!=0 and currtime>=TimeMat[row][col]:
return
TimeMat[row][col] = currtime
countTime(row+1,col,currtime+1)
countTime(row-1,col,currtime+1)
countTime(row,col+1,currtime+1)
countTime(row,col-1,currtime+1)
countTime(row+1,col+1,currtime+1)
countTime(row-1,col-1,currtime+1)
countTime(row+1,col-1,currtime+1)
countTime(row-1,col+1,currtime+1) 

countTime(irow-1,icol-1,1)

Time=-1
for i in range(M):
for j in range(N):
if Time<TimeMat[i][j]:
Time=TimeMat[i][j]
print(Time)

Forest Fire problem in few other Coding Languages

C

We don’t have the solution for this problem, you can contribute the answer of this code in C programming language, we post that answer on our page

C++

We don’t have the solution for this problem, you can contribute the answer of this code in C++ programming language, we post that answer on our page

Java

We don’t have the solution for this problem, you can contribute the answer of this code in Java programming language, we post that answer on our page