Round A 2021 Google Kick Start L Shaped Plots Problem| PYTHON | Know About

Problem

Given a grid of R rows and C columns each cell in the grid is either 0 or 1.

A segment is a nonempty sequence of consecutive cells such that all cells are in the same row or the same column. We define the length of a segment as number of cells in the sequence.

A segment is called "good" if all the cells in the segment contain only 1s.

An "L-shape" is defined as an unordered pair of segments, which has all the following properties:

Each of the segments must be a "good" segment.
The two segments must be perpendicular to each other.
The segments must share one cell that is an endpoint of both segments.
Segments must have length at least 2.
The length of the longer segment is twice the length of the shorter segment.

We need to count the number of L-shapes in the grid.

Below you can find two examples of correct L-shapes,

and three examples of invalid L-shapes.

Note that in the shape on the left, two segments do not share a common endpoint. The next two shapes do not meet the last requirement, as in the middle shape both segments have the same length, and in the last shape the longer segment is longer than twice the length of the shorter one.

Input

The first line of the input contains the number of test cases, T. T test cases follow.

The first line of each testcase contains two integers R and C.

Then, R lines follow, each line with C integers representing the cells of the grid.

Output

For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is the number of L-shapes.

In Sample Case #1, there is one L-shape.
The first one is formed by using cells: (1,1), (2,1), (3,1), (4,1), (4,2)

In Sample Case #2, there are nine L-shapes.

The first one is formed by using cells: (1,1), (2,1), (3,1), (4,1), (5,1), (6,1), (6,2), (6,3) The second one is formed by using cells: (3,1), (4,1), (5,1), (6,1), (6,2)
The third one is formed by using cells: (6,1), (5,1), (4,1), (3,1), (3,2)
The fourth one is formed by using cells: (3,3), (4,3), (5,3), (6,3), (6,2)
The fifth one is formed by using cells: (6,3), (5,3), (4,3), (3,3), (3,2)
The sixth one is formed by using cells: (3,1), (3,2), (3,3), (3,4), (2,4)
The seventh one is formed by using cells: (3,4), (3,3), (3,2), (3,1), (2,1)
The eighth one is formed by using cells: (3,4), (3,3), (3,2), (3,1), (4,1)
The ninth one is formed by using cells: (6,3), (5,3), (4,3), (3,3), (3,4)
The first three L-shapes are shown on the picture below.

PROGRAM

def number_of_l_shapes(len_1, len_2): if len_1 <= 1 or len_2 <= 1: return 0 return min(len_1 // 2, len_2) + min(len_1, len_2 // 2) - 2 T = int(input()) for t in range(T): R, C = map(int, input().split()) G = [list(map(int, input().split())) for _ in range(R)] left = [] for i in range(R): row = [G[i][0]] for j in range(1, C): row += [0 if G[i][j] == 0 else row[j-1] + 1] left.append(row) right = [] for i in range(R): revered_row = list(reversed(G[i])) row = [revered_row[0]] for j in range(1, C): row += [0 if revered_row[j] == 0 else row[j-1] + 1] right.append(list(reversed(row))) top = [[G[0][j] for j in range(C)]] for i in range(1, R): row = [ 0 if G[i][j] == 0 else top[i - 1][j] + 1 for j in range(C) ] top.append(row) bottom = [[G[R-1][j] for j in range(C)]] for i in range(1, R): row = [ 0 if G[R - i - 1][j] == 0 else bottom[i - 1][j] + 1 for j in range(C) ] bottom.append(row) bottom.reverse() ans = 0 for i in range(R): for j in range(C): ans += number_of_l_shapes(top[i][j], right[i][j]) \ + number_of_l_shapes(top[i][j], left[i][j]) \ + number_of_l_shapes(bottom[i][j], right[i][j]) \ + number_of_l_shapes(bottom[i][j], left[i][j]) print(f'Case #{t+1}:', ans)

Here is the link for Google KickStart Round A 2020 Plates problem using JAVA.