The city of Gridland is represented as an matrix where the rows are numbered from to and the columns are numbered from to .
Gridland has a network of train tracks that always run in straight horizontal lines along a row. In other words, the start and end points of a train track are and , where represents the row number, represents the starting column, and represents the ending column of the train track.
The mayor of Gridland is surveying the city to determine the number of locations where lampposts can be placed. A lamppost can be placed in any cell that is not occupied by a train track.
Given a map of Gridland and its train tracks, find and print the number of cells where the mayor can place lampposts.
Note: A train track may overlap other train tracks within the same row.
If Gridland's data is the following (1-based indexing):
k = 3
r c1 c2
1 1 4
2 2 4
3 1 2
4 2 3
It yields the following map:
In this case, there are five open cells (red) where lampposts can be placed.
Complete the gridlandMetro function in the editor below.
gridlandMetro has the following parameter(s):
int n:: the number of rows in Gridland
int m:: the number of columns in Gridland
int k:: the number of tracks
track[k]: each element contains integers that represent , all 1-indexed
int: the number of cells where lampposts can be installed
The first line contains three space-separated integers and , the number of rows, columns and tracks to be mapped.
Each of the next lines contains three space-separated integers, and , the row number and the track column start and end.
4 4 3 n = 4, m = 4, k = 3
2 2 3 track = [[2, 2, 3], [3, 1, 4], [4, 4, 4]]
3 1 4
4 4 4
In the diagram above, the yellow cells denote the first train track, green denotes the second, and blue denotes the third. Lampposts can be placed in any of the nine red cells.