CodeForces 615A Bulbs
2016-01-12 21:50
211 查看
A. Bulbs
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
input
output
input
output
Note
In the first sample you can press each button once and turn on all the bulbs. In the 2 sample it is impossible to turn on the 3-rd lamp.
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
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
Note
In the first sample you can press each button once and turn on all the bulbs. In the 2 sample it is impossible to turn on the 3-rd lamp.
#include <iostream> #include<cstdio> #include<cstring> #define maxn 110 using namespace std; bool vis[maxn]; int main() { int n,m,a,t; while(~scanf("%d%d",&n,&m)) { memset(vis,false,sizeof(vis)); while(n--) { scanf("%d",&a); for(int i=0;i<a;++i) { scanf("%d",&t); vis[t]=true; } } int flag=0; for(int i=1;i<=m;++i) { if(!vis[i]) { flag=1; break; } } if(!flag) printf("YES\n"); else printf("NO\n"); } return 0; }
相关文章推荐
- Spring MVC 测试 | 模拟提交表单
- 如何在真机上调试Android应用程序(图文详解)
- 西部数码服务器一些配置
- UEditor 1.4.3.1.NET版本上传配置备忘录
- wireshark
- python 列表总结
- 为Mac自带的Apache配置PHP和虚拟机
- EF Mapping Realtionship HasMany HasRequired
- Android中Okhttp和SPDY协议
- hadoop基础:第二部分 关于MapReduce
- httpd(2.2&2.4)RPM搭建配置定义详解
- Linux内核构建系统之八
- 架构师职业加点攻略
- Ubuntu 14.04 VNC服务端和客户端配置
- android 自动换行的线性布局
- 第六章 聚合函数与分组
- 发动机起动电机_蓄电池_发电机与整车匹配
- win0 环境下局域网 搭建FTP服务器
- jQuery仿QQ空间图片查看特效(全屏,放大,缩小,旋转,镜像,鼠标滚轮缩放)
- 数据库优化---索引设计