1
# Runtime: 2054 ms (Top 5.33%) | Memory: 24.4 MB (Top 72.78%)
2
class Solution:
3
    def reconstructMatrix(
4
        self, upper: int, lower: int, colsum: List[int]
5
    ) -> List[List[int]]:
6
        n = len(colsum)
7
        matrix = [[0 for i in range(n)] for j in range(2)]
8
        for col, summ in enumerate(colsum):
9
            if summ == 0:
10
                continue
11
            if summ == 2:
12
                matrix[0][col] = matrix[1][col] = 1
13
                upper -= 1
14
                lower -= 1
15
            else:
16
                if upper > lower:
17
                    matrix[0][col] = 1
18
                    upper -= 1
19
                else:
20
                    matrix[1][col] = 1
21
                    lower -= 1
22
            if upper < 0 or lower < 0:
23
                break
24

25
        return matrix if upper == lower == 0 else []