Head Maker

TimeLimit:2000MS  MemoryLimit:524288KB
64-bit integer IO format:%I64d
未提交 | 登录后收藏
Problem Description
Zhang3's favorite toy, Steve, has been hit and his head was broken. Zhang3 wants to make a cube as a new head for him.

Zhang3 got a piece of grid paper as material, satisfying the conditions below:

- The grid paper consists of $n \times m$ square units, forming $n$ rows by $m$ columns.
- Some units of the grid paper are broken, the others are usable.
- All of the usable units are 4-connected (two units are directly connected by sharing an edge).

By using some tools, she can do the following things for arbitrary times:

- Cut along an edge on the grid paper. After doing this, the paper mustn't be split into two pieces, i.e., all the usable units are still 4-connected.
- Fold along an edge, so that the two adjacent units form a right angle.

A cube has six faces. Every unit should overlap with one of the six faces. The paper is so thin that it's possible to overlap more than one units at the same face. But it's not allowed to leave a face without any units.

Help Zhang3 determine whether it is possible to make a cube with the grid paper.
Input
The first line of the input gives the number of test cases, $T \; (1 \le T \le 100)$. $T$ test cases follow.

For each test case, the first line contains two integers $n, m \; (1 \le n,m \le 6)$, the size of the grid paper.

Then $n$ lines follow, each contains a string of length $m$, describing the grid. Each character is $0$ or $1$, where $0$ means the unit is broken, and $1$ means the unit is usable.
Output
For each test case, print a line with a string $\text{Yes}$ or $\text{No}$, representing the answer.
SampleInput
2
2 5
11111
11000
2 5
11111
01100
SampleOutput
No
Yes
Submit
题目统计信息详细
总AC数0
通过人数0
尝试人数0
总提交量0
AC率0.00%
AC该题后可以添加标签
贴完标签可以获得20ACB。
并且可以获得本题所有提交代码查看权限。
点击标题可以显示标签。
如果你还没认真思考过这题,请不要查看标签
如果您已经通过了该题,请务为该题贴上标签

T^T Online Judge

[BUG反馈] [FAQ] [闽ICP备17026590号-1]
当前版本:3.24 系统时间: