题目描述
<p><span style="line-height:150%;font-family:宋体;">最近小仲迷上一个角水管工的游戏,游戏的大致规则是这样的,一块矩阵土地被分为</span><span style="line-height:150%;">M</span><span style="line-height:150%;font-family:宋体;">×</span><span style="line-height:150%;">N</span><span style="line-height:150%;font-family:宋体;">的单位正方形,每一个单位正方形要不都埋设一根水管或者种植了树木(种植树木的地方没有管道),水管将从坐标为(</span><span style="line-height:150%;">1,1</span><span style="line-height:150%;font-family:宋体;">)的左部边缘,延伸到坐标为(</span><span style="line-height:150%;">M</span><span style="line-height:150%;font-family:宋体;">,</span><span style="line-height:150%;">N</span><span style="line-height:150%;font-family:宋体;">)的右部边缘。水管只有两种,如下图所示:</span></p> <p><span style="line-height:150%;font-family:宋体;"> <img src="http://tk.hustoj.com/upload/201512/a.png" width="60" height="60" alt="" /> <img src="http://tk.hustoj.com/upload/201512/b.png" width="60" height="60" alt="" /></span></p> <p><span style="line-height:150%;font-family:宋体;">每种管道将占据一个单位正方形土地,你可以旋转每个单元正方形上的管道,使其构成一个管道系统,即创造一条从(</span><span style="line-height:150%;">1,1</span><span style="line-height:150%;font-family:宋体;">)到(</span><span style="line-height:150%;">M</span><span style="line-height:150%;font-family:宋体;">,</span><span style="line-height:150%;">N</span><span style="line-height:150%;font-family:宋体;">)的连通管道。如下图</span></p> <p><img src="http://tk.hustoj.com/upload/201512/c.png" width="80" height="100" alt="" /> <img src="http://tk.hustoj.com/upload/201512/d.jpg" width="80" height="90" alt="" /></p> <p><img src="http://tk.hustoj.com/upload/201512/e.png" width="649" height="129" alt="" /></p> <p class="MsoNormal" style="text-indent:21.0pt;"></p> <p class="MsoNormal" style="text-indent:21.0pt;"></p>
输入格式
<p><span style="line-height:150%;font-family:宋体;">每个测试案例的第一行有两个数,第</span><span style="line-height:150%;">1</span><span style="line-height:150%;font-family:宋体;">个数是</span><span style="line-height:150%;">M</span><span style="line-height:150%;font-family:宋体;">,第</span><span style="line-height:150%;">2</span><span style="line-height:150%;font-family:宋体;">个数是</span><span style="line-height:150%;">N</span><span style="line-height:150%;font-family:宋体;">,</span><span style="line-height:150%;">(N</span><span style="line-height:150%;font-family:宋体;">,</span><span style="line-height:150%;">M<25)</span><span style="line-height:150%;font-family:宋体;">,接着是</span><span style="line-height:150%;">M</span><span style="line-height:150%;font-family:宋体;">行数据,每一行有</span><span style="line-height:150%;">N</span><span style="line-height:150%;font-family:宋体;">个非负整数,每个整数表示地图中的每一小格的管道摆放方式,其中</span><span style="line-height:150%;">0</span><span style="line-height:150%;font-family:宋体;">表示树木,</span><span style="line-height:150%;">1~6</span><span style="line-height:150%;font-family:宋体;">分别表示管道的</span><span style="line-height:150%;">6</span><span style="line-height:150%;font-family:宋体;">中不同的摆放方式。</span></p> <p><span style="line-height:150%;font-family:宋体;"><img src="http://tk.hustoj.com/upload/201512/e(1).png" width="649" height="129" alt="" /></span></p> <p class="MsoNormal" style="text-indent:21.0pt;"></p>
输出格式
<p><span style="line-height:150%;font-family:宋体;">如果从(</span><span style="line-height:150%;">1</span><span style="line-height:150%;font-family:宋体;">,</span><span style="line-height:150%;">1</span><span style="line-height:150%;font-family:宋体;">)能够有创建管道连通(</span><span style="line-height:150%;">M</span><span style="line-height:150%;font-family:宋体;">,</span><span style="line-height:150%;">N</span><span style="line-height:150%;font-family:宋体;">),则输出</span><span style="line-height:150%;">yes</span><span style="line-height:150%;font-family:宋体;">,否则输出,</span><span style="line-height:150%;">no way</span><span style="line-height:150%;font-family:宋体;">。</span></p> <p class="MsoNormal" style="text-indent:21.0pt;"></p>
样例
样例输入 1
5 4
5 3 5 3
1 5 3 0
2 3 5 1
6 1 1 5
1 5 5 4
2 2
1 2
1 1
2 2
1 1
1 1
样例输出 1
yes
no way
no way
提交代码
请先登录后提交
🤖 AI 解题助手
DeepSeek
就绪