To brighten up the gala dinner of the IOI‘98 we have a set of N (10 <= N <= 100) colored lamps numbered from 1 to N.
The lamps are connected to four buttons:
A counter C records the total number of button presses.
When the party starts, all the lamps are ON and the counter C is set to zero.
You are given the value of counter C (0 <= C <= 10000) and the final state of some of the lamps after some operations have been executed. Write a program to determine all the possible final configurations of the N lamps that are consistent with the given information, without repetitions.
No lamp will be listed twice in the input.
Line 1: | N |
Line 2: | Final value of C |
Line 3: | Some lamp numbers ON in the final configuration, separated by one space and terminated by the integer -1. |
Line 4: | Some lamp numbers OFF in the final configuration, separated by one space and terminated by the integer -1. |
10 1 -1 7 -1
In this case, there are 10 lamps and only one button has been pressed. Lamp 7 is OFF in the final configuration.
Lines with all the possible final configurations (without repetitions) of all the lamps. Each line has N characters, where the first character represents the state of lamp 1 and the last character represents the state of lamp N. A 0 (zero) stands for a lamp that is OFF, and a 1 (one) stands for a lamp that is ON. The lines must be ordered from least to largest (as binary numbers).
If there are no possible configurations, output a single line with the single word `IMPOSSIBLE‘
0000000000 0101010101 0110110110
In this case, there are three possible final configurations:
怎么说呢,这道题还是有一定难度的。重点在于对于题目的分析。
给大家推荐的题解,上面有很多解释。
http://www.nocow.cn/index.php/USACO/lamps
有一定基础的同学可以尝试解决这道题目,独立思考,可以锻炼我们的思维能力(作者思维能力就很差)
由于我是自己写的暴力,很复杂,用时也很不优秀,就不贴代码了。
原文:http://www.cnblogs.com/hhhhhhhhhh/p/5154819.html