2021 USAMO Problems/Problem 3
Let be an integer. An board is initially empty. Each minute, you may perform one of three moves:
- If there is an L-shaped tromino region of three cells without stones on the board (see figure; rotations not allowed), you may place a stone in each of those cells.
- If all cells in a column have a stone, you may remove all stones from that column.
- If all cells in a row have a stone, you may remove all stones from that row.
For which is it possible that, after some non-zero number of moves, the board has no stones?
Solution 1
Label the bottom right cell as where . Then label each cell with where is the Manhattan distance of the current cell from the bottom right cell.
No matter where an L-shaped tromino is placed, the sum of the labels in the cells is,
If . Then the sum of all the labels in the cells in a row or column is,
If . Then the sum of all the labels in cells in a row or column is,
Let be the sum of all the labels of cells containing a stone. In either above case, placing an L-shaped Tromino leaves invariant but removing a row or column of stone causes to decrease (by or in each case). However the empty grid has , so this can't be reached.
Hence . We now provide a sequence of moves which empties the grid. Divide the grid into grids and do the following to every sub-grid. (When I refer to placing an L-shaped tromino on a cell, I am refering to the position of the bottom left stone)
- Add an L-shaped tromino to the bottom left cell and middle cell
- Remove the middle row
- Add an L-shaped tromino to the middle left cell
- Remove the left and middle columns
and we're done, the grid is empty