303863: CF745B. Hongcow Solves A Puzzle

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Hongcow Solves A Puzzle

题意翻译

给你一个二维字符数组,问其中包含了全部的 $X$ 字符的矩阵的面积是否与 $X$ 字符的数量相等。相等输出 $YES$,不相等输出 $NO$。——Glad

题目描述

Hongcow likes solving puzzles. One day, Hongcow finds two identical puzzle pieces, with the instructions "make a rectangle" next to them. The pieces can be described by an $ n $ by $ m $ grid of characters, where the character 'X' denotes a part of the puzzle and '.' denotes an empty part of the grid. It is guaranteed that the puzzle pieces are one 4-connected piece. See the input format and samples for the exact details on how a jigsaw piece will be specified. The puzzle pieces are very heavy, so Hongcow cannot rotate or flip the puzzle pieces. However, he is allowed to move them in any directions. The puzzle pieces also cannot overlap. You are given as input the description of one of the pieces. Determine if it is possible to make a rectangle from two identical copies of the given input. The rectangle should be solid, i.e. there should be no empty holes inside it or on its border. Keep in mind that Hongcow is not allowed to flip or rotate pieces and they cannot overlap, i.e. no two 'X' from different pieces can share the same position.

输入输出格式

输入格式


The first line of input will contain two integers $ n $ and $ m $ ( $ 1<=n,m<=500 $ ), the dimensions of the puzzle piece. The next $ n $ lines will describe the jigsaw piece. Each line will have length $ m $ and will consist of characters '.' and 'X' only. 'X' corresponds to a part of the puzzle piece, '.' is an empty space. It is guaranteed there is at least one 'X' character in the input and that the 'X' characters form a 4-connected region.

输出格式


Output "YES" if it is possible for Hongcow to make a rectangle. Output "NO" otherwise.

输入输出样例

输入样例 #1

2 3
XXX
XXX

输出样例 #1

YES

输入样例 #2

2 2
.X
XX

输出样例 #2

NO

输入样例 #3

5 5
.....
..X..
.....
.....
.....

输出样例 #3

YES

说明

For the first sample, one example of a rectangle we can form is as follows `<br></br>111222<br></br>111222<br></br>`For the second sample, it is impossible to put two of those pieces without rotating or flipping to form a rectangle. In the third sample, we can shift the first tile by one to the right, and then compose the following rectangle: `<br></br>.....<br></br>..XX.<br></br>.....<br></br>.....<br></br>.....<br></br>`

Input

题意翻译

给你一个二维字符数组,问其中包含了全部的 $X$ 字符的矩阵的面积是否与 $X$ 字符的数量相等。相等输出 $YES$,不相等输出 $NO$。——Glad

加入题单

上一题 下一题 算法标签: