当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5546:Ancient Go

题目描述
Yu Zhou likes to play Go with Su Lu. From the historical research, we found that there are much difference on the rules between ancient go and modern go.

Here is the rules for ancient go they were playing:

$\cdot$The game is played on a $8×8$ cell board, the chess can be put on the intersection of the board lines, so there are $9×9$ different positions to put the chess.
$\cdot$Yu Zhou always takes the black and Su Lu the white. They put the chess onto the game board alternately.
$\cdot$The chess of the same color makes connected components(connected by the board lines), for each of the components, if it's not connected with any of the empty cells, this component dies and will be removed from the game board.
$\cdot$When one of the player makes his move, check the opponent's components first. After removing the dead opponent's components, check with the player's components and remove the dead components.
One day, Yu Zhou was playing ancient go with Su Lu at home. It's Yu Zhou's move now. But they had to go for an emergency military action. Little Qiao looked at the game board and would like to know whether Yu Zhou has a move to kill at least one of Su Lu's chess.
输入解释
The first line of the input gives the number of test cases, $T(1≤T≤100)$. $T$ test cases follow. Test cases are separated by an empty line. Each test case consist of 9 lines represent the game board. Each line consists of 9 characters. Each character represents a cell on the game board. $'.'$ represents an empty cell. $'x'$ represents a cell with black chess which owned by Yu Zhou. $'o'$ represents a cell with white chess which owned by Su Lu.
输出解释
For each test case, output one line containing Case #x: y, where $x$ is the test case number (starting from 1) and $y$ is Can kill in one move!!! if Yu Zhou has a move to kill at least one of Su Lu's components. Can not kill in one move!!! otherwise.
输入样例
2

.......xo
.........
.........
..x......
.xox....x
.o.o...xo
..o......
.....xxxo
....xooo.

......ox.
.......o.
...o.....
..o.o....
...o.....
.........
.......o.
...x.....
........o
输出样例
Case #1: Can kill in one move!!!
Case #2: Can not kill in one move!!!
提示
In the first test case, Yu Zhou has 4 different ways to kill Su Lu's component.

In the second test case, there is no way to kill Su Lu's component.
来自杭电HDUOJ的附加信息
Recommend wange2014

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-5546

最后修改于 2020-10-25T23:23:39+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
3000/1000MS(Java/Others) 65535/65535K(Java/Others)