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

建议使用的浏览器:

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

2467:Déjà vu

题目描述
An antique machine with C(n , 3) switches capable of processing integers in the range 0...2N-1 has just been discovered. Each switch is associated to a distinct integer in 0...2N-1 with exactly three ones in its binary representation. By setting switches associated with number X0,X1...XM-1 to on, any integer Y passing through the machine will render a result of Y⊕X0⊕X1⊕...⊕XM-1(here “⊕” stands for bitwise-XOR).
Further inspections reveal that contrary to what we assumed in problem B, some of the switches on the machine are damaged due to their old age. We are interested in whether a configuration transforming integer S into T still exists, and if so, the minimum number of switches that have to be set to on to make it possible.
WARNING: a naive algorithm might not be sufficient to solve this problem.
输入解释
There are multiple test cases in the input file.
Each test case starts with two integers, N and M ( 1 ≤ N ≤ 20), representing the number of bits and the number of functioning switches, respectively. Two integers, S and T ( 0 ≤ S,T < 2N), come in the next line, followed by another M lines, the ith one describing the value Vi associated to the ith switch ( 0 ≤ Vi < 2N).
Two successive test cases are separated by a blank line. A case with N = 0 and M = 0 indicates the end of the input file, and should not be processed by your program.
输出解释
For each test case, please print a single integer, the minimum number of
operations, or “Impossible” (without quotes) if no feasible sequence exists.
输入样例
6 7
55 21
11
22
25
56
41
49
28
5 2
0 21
22
28
0 0
输出样例
Case #1: 2
Case #2: Impossible
来自杭电HDUOJ的附加信息
Recommend lcy

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

源链接: HDU-2467

最后修改于 2020-10-25T22:53:42+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
30000/10000MS(Java/Others) 32768/32768K(Java/Others)