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

建议使用的浏览器:

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

2147:Dice Puzzle

题目描述
Let's try a dice puzzle. The rules of this puzzle are as follows.
1. Dice with six faces as shown in Figure 6 are used in the puzzle.
2. With twenty seven such dice, a 3 * 3 * 3 cube is built as shown in Figure 7.
3. When building up a cube made of dice, the sum of the numbers marked on the faces of adjacent dice that are placed against each other must be seven (See Figure 8). For example, if one face of the pair is marked "2", then the other face must be "5".
4. The top and the front views of the cube are partially given, i.e. the numbers on faces of some of the dice on the top and on the front are given (See Figure 9).
5. The goal of the puzzle is to find all the plausible dice arrangements that are consistent with the given top and front view information.

Your job is to write a program that solves this puzzle.

输入解释
The input consists of multiple datasets in the following format.
N
Dataset1
Dataset2
: : :
DatasetN

N is the number of the datasets.
The format of each dataset is as follows.
T11 T12 T13
T21 T22 T23
T31 T32 T33
F11 F12 F13
F21 F22 F23
F31 F32 F33

Tij and Fij (1 <= i <= 3, 1 <= j <= 3) are the faces of dice appearing on the top and front views, as shown in Figure 7, or a zero. A zero means that the face at the corresponding position is unknown.
输出解释
For each plausible arrangement of dice, compute the sum of the numbers marked on the nine faces appearing on the right side of the cube, that is, with the notation given in Figure 7,Σ1<=i<=3Σ1<=j<=3Rij.
For each dataset, you should output the right view sums for all the plausible arrangements, in ascending order and without duplicates. Numbers should be separated by a single space. When there are no plausible arrangements for a dataset, output a zero.
For example, suppose that the top and the front views are given as Figure 10.
There are four plausible right views as shown in Figure 11. The right view sums are 33, 36, 32, and 33, respectively. After rearranging them into ascending order and eliminating duplicates, the answer should be "32 33 36".
The output should be one line for each dataset.
输入样例
4
1 1 1
1 1 1
1 1 1
2 2 2
2 2 2
2 2 2
4 3 3
5 2 2
4 3 3
6 1 1
6 1 1
6 1 0
1 0 0
0 2 0
0 0 0
5 1 2
5 1 2
0 0 0
2 0 0
0 3 0
0 0 0
0 0 0
0 0 0
3 0 1
输出样例
27
24
32 33 36
0

该题目是Virtual Judge题目,来自 北京大学POJ

题目来源 Japan 2004

源链接: POJ-2147

最后修改于 2020-10-29T06:24:38+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
5000 65536