Vase collection
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 1536 | Accepted: 552 |
Description
Mr Cheng is a collector of old Chinese porcelain, more specifically late 15th century Feng dynasty vases. The art of vase-making at this time followed very strict artistic rules. There was a limited number of accepted styles, each defined by its shape and decoration. More specifically, there were 36 vase shapes and 36 different patterns of decoration ? in all 1296 different styles.
For a collector, the obvious goal is to own a sample of each of the 1296 styles. Mr Cheng however,like so many other collectors, could never afford a complete collection, and instead concentrates on some shapes and some decorations. As symmetry between shape and decoration was one of the main aestheathical paradigms of the Feng dynasty, Mr Cheng wants to have a full collection of all combinations of k shapes and k decorations, for as large a k as possible. However, he has discovered that determining this k for a given collection is not always trivial. This means that his collection might actually be better than he thinks. Can you help him?
For a collector, the obvious goal is to own a sample of each of the 1296 styles. Mr Cheng however,like so many other collectors, could never afford a complete collection, and instead concentrates on some shapes and some decorations. As symmetry between shape and decoration was one of the main aestheathical paradigms of the Feng dynasty, Mr Cheng wants to have a full collection of all combinations of k shapes and k decorations, for as large a k as possible. However, he has discovered that determining this k for a given collection is not always trivial. This means that his collection might actually be better than he thinks. Can you help him?
Input
On the first line of the input, there is a single positive integer n, telling the number of test scenarios to follow. Each test scenario begins with a line containing a single positive integer m <= 100, the number of vases in the collection. Then follow m lines, one per vase, each with a pair of numbers, si and di, separated by a single space, where si ( 0 < si <= 36 ) indicates the shape of Mr Cheng's i:th vase, and di ( 0 < di <= 36 ) indicates its decoration.
Output
For each test scenario, output one line containing the maximum k, such that there are k shapes and k decorations for which Mr Cheng's collection contains all k*k combined styles.
Sample Input
2 5 11 13 23 5 17 36 11 5 23 13 2 23 15 15 23
Sample Output
2 1
Source
/*
搜索的好题
数据结构与状态的表示如下：
1)对于输入i,j置graph[j][i] = true, 称作j和i存在映射关系
2)为了节省搜索时间将收入中出现过的数据，分别顺序存入setsf, setst,并统计数目setsfn,setstn
3)状态利用bit位来表示，每一个shape占一位，用来表示当前的shape是否处在可选集合中，一共可能
有36种shape，所以需要用到__int64，普通int已经无法容纳
搜索策略如下：采用DFS搜索，搜索从第一个decoration开始，依次往下遍历，每处理一个decoration时
需要判断当前decoration能否被选，如果可以被选那么下一步可以有两种选择，选择该decoration和不选
该decoration
假设当前可选集合中decoration的数量是num,则判断当前decoration可不可以被选的方法如下：对于当前
状态state中，必须存在至少num + 1种shape是当前decoration在输入数据中映射到的,注意要特殊处理起
始情况即num为0的情况
| 6095577 | bobten2008 | 1632 | Accepted | 168K | 16MS | C++ | 1428B | 2009-11-06 13:53:17 |
*/
扫一扫
5536
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
