F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Head Maker

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 34    Accepted Submission(s): 21


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.
 

Sample Input
2 2 5 11111 11000 2 5 11111 01100
 

Sample Output
No Yes
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-24 20:21:25, Gzip enabled