P7615 [COCI 2011/2012 #2] OKRET

You are given an $R \times C$ map, where `.` means the cell is walkable and `X` means the cell is not walkable. Determine whether the map contains any dead ends. A cell is a dead end if among its four neighboring cells (up, down, left, right), **only one cell is walkable**. Of course, you cannot move outside the map.

The first line contains two positive integers $R, C$. The next $R$ lines each contain $C$ characters describing the map.

If the map contains a dead end, output $1$; otherwise, output $0$.

#### Constraints For $100\%$ of the testdata, $3 \le R, C \le 10$. #### Notes The score of this problem follows the original COCI settings, with a maximum of $80$ points. Translated from **[COCI2011-2012](https://hsin.hr/coci/archive/2011_2012/) [CONTEST #2](https://hsin.hr/coci/archive/2011_2012/contest2_tasks.pdf)** ___T2 OKRET___. Translated by ChatGPT 5