New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Buildings Projection

Contributed by

Himanshu Tanwar

Medium

0/80

Avg time to solve 15 mins

Success Rate 85 %

13 upvotes

Problem Statement

Ninja Land can be represented as a N * N grid in the XY plane. Each cell of this grid can have a building of some height.

You are given a matrix ‘GRID[][]’ of size ‘N’ * ‘N’, where ‘GRID[i][j]’ gives the height of the building at cell (i, j) in XY plane. Note, building at any cell (i, j) is represented as a cuboid that is an axis aligned with the axis ‘X’, ‘Y’, ‘Z’ and has the dimension 1 * 1 * GRID[i][j] along X, Y, Z-axis respectively.

Ninja views the projection of these buildings onto the XY, YZ, and ZX planes. A projection is like a shadow, that maps a 3-dimensional figure to a 2-dimensional plane. We are viewing the "shadow" when looking from the top, the side, and the front, in XY, YZ, ZX plane respectively.

Your task is to find and return the total area of all three projections. See the example for more clarity.

Note:

 ‘GRID[i][j]’ = 0, if there is no building at cell (i, j).

Example:

Consider the following 2*2 ‘GRID[][]’:
                [1, 2]
                [3, 4]

Its projection in XY, YZ, XZ plane is shown below -:

Area covered in XY plane is 4, Area covered in YZ plane is 6, Area covered in ZX plane is 7, Thus the total area is 4 + 6 + 7 = 17.

Detailed explanation ( Input/output format, Notes, Constraints, Images )

Input Format:

The first line contains a single integer ‘T’ representing the number of test cases. 

The first line of each test case will contain a single integer ‘N’, representing the dimensions of ‘GRID’ 

The next ‘N’ line of each test case will follow, each contains ‘N’ space-separated integers. These ‘N’ lines together represent the matrix ‘GRID[][]’.

Output Format:

For each test case, print a single integer that represents the total area of projections in the XY, YZ, and ZX plane.

Output for every test case will be printed in a separate line.

Note:

You don’t need to print anything; it has already been taken care of. Just implement the given function.

Constraints:

1 <= T <= 50
2 <= N <= 1000
0 <= GRID[i][j] <= 100

Where ‘GRID[i][j]’ is the height of the building at cell (i, j).

Time limit: 1 sec

Sample Input 1:

Sample Output 1:

3
17

Explanation of sample input 1:

In the first test case,  there is a 1*1 grid, and its only cell i.e cell (0, 0) has a building of height 1. Thus its projection in all three planes also takes area 1.

For the second test case, see the problem statement for an explanation.

Sample Input 2:

Sample Output 2:

0
14

Auto

Console