Reconstruct Tilings from projections

This implements the greedy reconstruction algorithm for a tiling of a grid with vertical dominoes and squares. The input of the problem are the number of dominoes in every column and the number of squares in every row. The output is a tiling which has exactly the given projections, if there is any. The algorithm has been analyzed in [DGRR99] and independently by C. Picouleau.

Input

row projections (number of squares per row)
column projections (number of dominoes per column)

Output










[source]