Heap Pirates

For a binary matrix with $R$ rows and $C$ columns (each cell in a binary matrix contains either $0$ or $1$), we define the *associated graph* of this matrix as follows: - each $8$-connected component of cells containing the same value corresponds to one node of the graph - for each pair of adjacent $8$-connected components, there is an edge between their corresponding nodes A cell in 8-connected