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

建议使用的浏览器:

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

5506:GT and set

题目描述
You are given $N$ sets.The $i-$th set has $A_i$ numbers.

You should divide the sets into $L$ parts.

And each part should have at least one number in common.

If there is at least one solution,print $YES$,otherwise print $NO$.
输入解释
In the first line there is the testcase $T$ ($T$$\leq$$20$)

For each teatcase:

In the first line there are two numbers $N$ and $L$.

In the next $N$ lines,each line describe a set.

The first number is $A_i$,and then there are $A_i$ distict numbers stand for the elements int the set.

The numbers in the set are all positive numbers and they're all not bigger than $300$.

$1\leq$$N$$\leq30$,$1\leq$$L\leq5$,$1\leq$$A_i$$\leq10$,$1 \leq L \leq N$

You'd better print the enter in the last line when you hack others.

You'd better not print space in the last of each line when you hack others.
输出解释
For each test print $YES$ or $NO$
输入样例
2
2 1
1 1
1 2
3 2
3 1 2 3
3 4 5 6
3 2 5 6
输出样例
NO
YES

提示
For the second test,there are three sets:{1,2,3},{4,5,6},{2,5,6}
You are asked to divide into two parts.
One possible solution is to put the second and the third sets into the same part,and put the first in the other part.
The second part and the third part have same number 6.
Another solution is to put the first and the third sets into the same part,and put the second in the other part.
来自杭电HDUOJ的附加信息
Recommend hujie

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

题目来源 BestCoder Round #60

源链接: HDU-5506

最后修改于 2020-10-25T23:23:15+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/65536K(Java/Others)