Hiko Seijuurou is looking for a suitable training ground for his students. He has a found a suitably perilous terrain of M×N𝑀×𝑁 cells. aij𝑎𝑖𝑗 is the altitude of the cell on the i𝑖-th row and the j𝑗-th column.Seijuurou plans to drop students at any of the cells and ask them to visit at least K𝐾 other cells. A student with capability c𝑐 can only move to an adjacent cell (up/down/right/left) if the absolute difference in altitude between the two cells is at most c𝑐.For each cell, find the minimum capability a student needs to have to visit at least K𝐾 other cells if they start at this cell.InputThree integers M,N,K𝑀,𝑁,𝐾 on the first line.M𝑀 lines follow with N𝑁 integers on each line. The j𝑗-th integer on the (i+1)(𝑖+1)-th line is aij𝑎𝑖𝑗.Three integers M,N,K𝑀,𝑁,𝐾 on the first line.Constraints1≤M,N≤5001≤𝑀,𝑁≤5000≤K≤MN−10≤𝐾≤𝑀𝑁−1−109≤aij≤+109−109≤𝑎𝑖𝑗≤+109OutputM𝑀 lines with N𝑁 integers on each line. The j𝑗-th integer on the i𝑖-th line should be the minimum capability a student needs to have to visit at least K𝐾 other cells if they start at cell (i,j)(𝑖,𝑗).Examplesinput2 2 1-3 -9-8 2output5 6 5 10 input5 7 67 6 -40 -11 -16 -28 -4737 -31 -19 -18 -13 -28 3414 -6 -46 0 -16 35 22-34 -23 -42 -40 -27 11 -439 5 -30 0 50 -32 0output30 30 21 11 11 12 19 23 12 11 11 11 12 38 20 19 13 16 11 38 38 19 19 13 13 11 38 43 28 28 13 30 50 43 43 NoteIn the first example, you need to reach only one other cell.From (1,1)(1,1), if you have 55 capability, you can reach cell (2,1)(2,1).From (1,2)(1,2), if you have 66 capability, you can reach cell (1,1)(1,1).From (2,1)(2,1), if you have 55 capability, you can reach cell (1,1)(1,1).From (2,2)(2,2), if you have 1010 capability, you can reach cell (2,1)(2,1).

There are n seats and n students in a room. You are given an array seats of length n, where seats[i] is the position of the ith seat. You are also given the array students of length n, where students[j] is the position of the jth student.You may perform the following move any number of times:Increase or decrease the position of the ith student by 1 (i.e., moving the ith student from position x to x + 1 or x - 1)Return the minimum number of moves required to move each student to a seat such that no two students are in the same seat.Note that there may be multiple seats or students in the same position at the beginning.

You are given a map of a city represented as a 2D grid, where some cells are blocked, some are open, and some contain different types of terrain that affect the cost of traversing them. You need to find the shortest path between two points on the map while avoiding blocked cells and taking into account the terrain cost. How would you approach this problem?a)Dijkstra's Algorithmb)Breadth-First Searchc)A* Search Algorithmd)Depth-First Search

Write a short note on cell demarcation

You are on a 22-dimensional grid, where you start at (0,0)(0,0).You are given a binary string 𝑆S of length 44 where:𝑆1S 1​ refers to left direction;𝑆2S 2​ refers to right direction;𝑆3S 3​ refers to up direction;𝑆4S 4​ refers to down direction.𝑆𝑖=1S i​ =1 denotes that you are allowed to make a move in the respective direction and vice-versa.Find the number of cells (𝑥,𝑦)(x,y) you can possibly visit which satisfy −10≤𝑥,𝑦≤10−10≤x,y≤10.Note that:You always include the cell (0,0)(0,0) in your answer.If you can visit (𝐴1,𝐵1)(A 1​ ,B 1​ ) and (𝐴2,𝐵2)(A 2​ ,B 2​ ) individually, but not both at the same time, you will still include both of them in your answer.Moves are defined as:A move in left direction is a move from cell (𝐴,𝐵)(A,B) to (𝐴−1,𝐵)(A−1,B).A move in right direction is a move from cell (𝐴,𝐵)(A,B) to (𝐴+1,𝐵)(A+1,B).A move in up direction is a move from cell (𝐴,𝐵)(A,B) to (𝐴,𝐵+1)(A,B+1).A move in down direction is a move from cell (𝐴,𝐵)(A,B) to (𝐴,𝐵−1)(A,B−1).Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of a binary string 𝑆S of length 44 - denoting the directions in which moves are allowed.Output FormatFor each test case, output on a new line, the number of cells you can visit as mentioned in statement.Constraints1≤𝑇≤151≤T≤15∣𝑆∣=4∣S∣=4𝑆𝑖∈{0,1}S i​ ∈{0,1}𝑆𝑖=1S i​ =1 for at least one 1≤𝑖≤41≤i≤4.Sample 1:InputOutput5001011000110111011111121121231441Explanation:Test case 11: The only allowed direction is up. Thus, you can only visit cells (0,0),(0,1),(0,2),…,(0,10)(0,0),(0,1),(0,2),…,(0,10); which are a total of 1111 cells.Test case 22: The allowed directions are left and right. Thus, you can visit cells (−10,0),(−9,0),…,(0,0),…,(9,0),(10,0)(−10,0),(−9,0),…,(0,0),…,(9,0),(10,0), which are a total of 2121 cells.Test case 33: The allowed directions are right and up. You can visit all cells (𝑥,𝑦)(x,y) such that 𝑥≥0x≥0 and 𝑦≥0y≥0, which are a total of 121121 cells.

During the morning assembly in a school, students stand in the playground in a fixed pattern of rows. Each row consists of students of only one particular class.1) There are four more rows of Class 10 students than of Class 5 students.2) The number of rows of Class 6 students is one less than of Class 10 students.3) One of the classes has the maximum number of rows, i.e., seven.4) There are two rows of Class 5 students.5) There are two more rows of Class 8 students than of Class 5 students.6) The number of rows of Class 9 students is less than that of Class 7 students.Analyze this information and answer the question given below.Which of the following is the total number of rows of Class 10 students? 4 5 6 7 8Mark for Later