# Block Party

Sudoku-like. Given a grid of arbitrarily shaped areas, some pre-filled, find:

- one integer per cell (per column per row)
- each area comprises the integers 1-K, where K is the total cell number
- nearest K is exactly K away, vertically or horizontally

Once the puzzle is solved, break every area into rows. Each row is an integer.

Find the maximum integer per area, and add them all up.

Credit for select/unselect: Ali A.