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

建议使用的浏览器:

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

4330:DUIDUI Bang

题目描述
You are given an 8 by 8 chessboard and five different kinds of pawn. The rule is simple; you can only swap two adjacent pawns. After the swap, if there are three or more consecutive identical pieces either horizontally or vertically, they will be eliminated. After that, the pawn will fall down to fill the empty grids. The empty grids that no pawn fills will be filled by randomly picked pawn from top edge. Sometimes you may be lucky enough to have the pawn eliminated automatically according to the rules above. In addition, if there is one move leads to eight or more than eight pawn to be eliminated, the player will be granted a combo. A smart guy as you are, could you please tell us what is the maximum possibility to trigger a combo in one swap?

In the figure, for example, swap the blue gem and the purple star will ensure a combo. Because, this will cause the red gem fall down and eliminated. The yellow gems will disappear after the red ones.
输入解释
The first line contains a single integer t, the number of test cases.
For each case, 8 lines contain pawn data. See sample input for more details.
输出解释
For each case, output maximum possibility of combo. See sample output for more details.
输入样例
2

10112344
13213241
30404021
31104204
23221011
02041200
14102122
22330443

13143243
42422004
11012130
34400104
03142423
21220441
01021133
43044200
输出样例
Case #1: 1.000
Case #2: 0.525
来自杭电HDUOJ的附加信息
Author BJTU
Recommend zhoujiaqi2010

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

源链接: HDU-4330

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

共提交 0

通过率 --%
时间上限 内存上限
18000/9000MS(Java/Others) 65536/65536K(Java/Others)