Problem of the day
Input: ‘M’ = 3, 'N' = 3, 'POSITIONS' = [ [ 0,0 ], [ 0,1 ], [ 1,2 ], [ 2,1 ] ]
Output: [1, 1, 2, 3]
Initially, the 2d 'GRID' is filled with water.
- Operation #1: addLand(0, 0) turns the water at ‘GRID[0][0]’ into a land. We have 1 island.
- Operation #2: addLand(0, 1) turns the water at ‘GRID[0][1]’ into a land. We still have 1 island.
- Operation #3: addLand(1, 2) turns the water at 'GRID[1][2]’ into a land. We have 2 islands.
- Operation #4: addLand(2, 1) turns the water at 'GRID[2][1]’ into a land. We have 3 islands.
The first line contains ‘T’, denoting the number of test cases.
The first line of each test case contains two integers, ‘N’ and ‘M’, denoting the number of rows and columns in the 'GRID'.
The second line of each test case contains an integer ‘K’ denoting the size of ‘POSITION’ array.
Each of the next ‘K’ lines contains two space-separated integers denoting the (‘Ri’, ‘Ci’) of ‘POSITION[i]’.
For each test case, return the array of integers as described in the problem statement.
You don't need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 10
1 <= M, N, K <= 100
0 <= Ri< m
0 <= Ci < n
Time Limit: 1 sec
2
1 3
3
0 0
0 1
0 2
1 3
3
0 0
0 2
0 1
##### Sample Output 1 :
1 1 1
1 2 1
For the first test case:-
- Operation #1: addLand(0, 0) turns the water at ‘GRID’[0][0] into a land. We have 1 island, [( 0, 0)].
- Operation #2: addLand(0, 1) turns the water at ‘GRID’[0][1] into a land. We still have 1 island, [ ( 0, 0) , ( 0, 1 ) ].
- Operation #3: addLand(0, 2) turns the water at 'GRID'[1][2] into a land. We still have 1 island, [ ( 0, 0) , ( 0, 1 ), ( 0, 2 ) ].
For the second test case:-
- Operation #1: addLand(0, 0) turns the water at ‘GRID’[0][0] into a land. We have 1 island, [ ( 0, 0 ) ].
- Operation #2: addLand(0, 2) turns the water at ‘GRID’[0][1] into a land. We still have 2 islands, [ ( 0, 0 ) ] and [ ( 0, 2 ) ].
- Operation #3: addLand(0, 2) turns the water at 'GRID'[1][2] into a land. We have 1 island, [ ( 0, 0) , ( 0, 1 ), ( 0, 2 ) ].
2
3 3
4
0 0
0 1
1 2
2 1
4 5
4
1 1
0 1
3 3
3 4
1 1 2 3
1 1 2 2