A. Bulbs
Description
Vasya wants to turn on Christmas lights consisting of m bulbs. Initially, all bulbs are turned off. There are n buttons, each of them is connected to some set of bulbs. Vasya can press any of these buttons. When the button is pressed, it turns on all the bulbs it’s connected to. Can Vasya light up all the bulbs?
If Vasya presses the button such that some bulbs connected to it are already turned on, they do not change their state, i.e. remain turned on.
Input
The first line of the input contains integers n and m (1 ≤ n, m ≤ 100) — the number of buttons and the number of bulbs respectively.
Each of the next n lines contains xi (0 ≤ xi ≤ m) — the number of bulbs that are turned on by the i-th button, and then xi numbers yij (1 ≤ yij ≤ m) — the numbers of these bulbs.
Output
If it’s possible to turn on all m bulbs print “YES”, otherwise print “NO”.
Sample Input
Input
3 4
2 1 4
3 1 3 1
1 2
Output
YES
Input
3 3
1 1
1 2
1 1
Output
NO
题意:n个开关控制m个灯,按下开关会把对应控制的灯打开(已经打开的状态不变),问能否把所有灯全打开,打个表看是否有灯漏下;
AC代码如下:
#include<stdio.h>
int main()
{
int a[10010]={0};
int i,n,m,k,x,j;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%d",&k);
for(j=1;j<=k;j++)
{
scanf("%d",&x);
a[x]=1;
}
}
int y=0;
for(i=1;i<=m;i++)
{
if(!a[i])
y=1;
}
if(y)
printf("NO\n");
else
printf("YES\n");
return 0;
}