Q1
jimmy is a stunt master in a circus which is in shape of matrix m*n. Jimmy is preparing for new stunt where fire starts from a point (fx,fy . Jimmy starts from a point (ix,iy) and reaches point (jx,jy). Jimmy moves 1 step in a second either horizontally or vertically. Fire spreads from the initial point with speed of 1 step per sec along x and y axes of initial starting point Jimmy have t combinations of start,end and fire start place but he is not sure if all places can make him reach endpoint without touching fire. Could you help jimmy in identifying which combinations can he chose for the stunt.
Constraints :
1 <= m , n <= 1000
1 <= t <= 10
Q2
There is a 2D plane of size NM. There is fire which is there at K different points in the 20 plane. From each of these K points, the fire is spreading in a circular form with the radius of the fire increasing by time. So, if at t-1, the radius of fire (represented by R) was 2, at 1-2, it becomes 4, at t=3, it become 6 and so on. T denotes time here. Help us determine, the number of points (points are denoted by oxy where both x and y are whole numbers, and are within the plane) which would not be touched by the fire
Constraints
1 <= N,M <= 1000
1 <= K <= 5