11218 - KTV
Time limit: 3.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=112&page=show_problem&problem=2159
One song is extremely popular recently, so you and your friends decided to sing it in KTV. The song has 3 characters, so exactly 3 people should sing together each time (yes, there are 3 microphones in the room). There are exactly 9 people, so you decided that each person sings exactly once. In other words, all the people are divided into 3 disjoint groups, so that every person is in exactly one group.
However, some people don't want to sing with some other people, and some combinations perform worse than others combinations. Given a score for every possible combination of 3 people, what is the largest possible score for all the 3 groups?
Input
The input consists of at most 1000 test cases. Each case begins with a line containing a single integern (0 < n < 81), the number of possible combinations. The next n lines each contains 4 positive integers a, b, c,s (1 <= a < b < c <= 9, 0 < s < 10000), that means a score ofs is given to the combination (a,b,c). The last case is followed by a single zero, which should not be processed.
Output
For each test case, print the case number and the largest score. If it is impossible, print -1.
Sample Input
3 1 2 3 1 4 5 6 2 7 8 9 3 4 1 2 3 1 1 4 5 2 1 6 7 3 1 8 9 4 0
Output for the Sample Input
Case 1: 6 Case 2: -1
O(n^3)枚举所有可能的情况并取最大值。
注意用位运算加快速度。
以上是小编为您精心准备的的内容，在的博客、问答、公众号、人物、课程等栏目也有的相关内容，欢迎继续使用右上角搜索按钮进行搜索位运算
， winforms ktv
， each
， exactly
， The
， some
运算符&&
9126 11218、svt11218scw、java 枚举、c 枚举、枚举类型enum用法，以便于您获取更多的相关知识。