Problem

Source: Vietnam TST 2021 P2

Tags: combinatorics



In a board of $2021 \times 2021$ grids, we pick $k$ unit squares such that every picked square shares vertice(s) with at most $1$ other picked square. Determine the maximum of $k$.