Tiling#3645
Given a rectangular field composed of free and occupied cells, your task is to determine whether it is possible to cover the field entirely with 2 \times 1 dominoes. Each domino must cover exactly two adjacent free cells, ensuring that each free cell is covered by one domino, while occupied cells remain uncovered. Additionally, no domino should extend beyond the field's boundaries.
The input begins with two integers, and (1 \le R, C \le 100), representing the dimensions of the field. This is followed by rows, each containing characters, which describe the cells. Each cell is denoted by either '.' for free or '#' for occupied.
Print "Yes" if it is possible to tile the field as described, otherwise print "No".
Example 1