B. Berland Bingo----模拟
来源:互联网 发布:知乎 中美军演 编辑:程序博客网 时间:2024/06/05 04:41
Lately, a national version of a bingo game has become very popular in Berland. There are n players playing the game, each player has a card with numbers. The numbers on each card are distinct, but distinct cards can have equal numbers. The card of the i-th player contains mi numbers.
During the game the host takes numbered balls one by one from a bag. He reads the number aloud in a high and clear voice and then puts the ball away. All participants cross out the number if it occurs on their cards. The person who crosses out all numbers from his card first, wins. If multiple people cross out all numbers from their cards at the same time, there are no winners in the game. At the beginning of the game the bag contains 100 balls numbered 1 through 100, the numbers of all balls are distinct.
You are given the cards for each player. Write a program that determines whether a player can win the game at the most favorable for him scenario or not.
The first line of the input contains integer n (1 ≤ n ≤ 100) — the number of the players. Then follow n lines, each line describes a player's card. The line that describes a card starts from integer mi (1 ≤ mi ≤ 100) that shows how many numbers the i-th player's card has. Then follows a sequence of integers ai, 1, ai, 2, ..., ai, mi (1 ≤ ai, k ≤ 100) — the numbers on the i-th player's card. The numbers in the lines are separated by single spaces.
It is guaranteed that all the numbers on each card are distinct.
Print n lines, the i-th line must contain word "YES" (without the quotes), if the i-th player can win, and "NO" (without the quotes) otherwise.
31 13 2 4 12 10 11
YESNOYES
21 11 1
NONO
题目链接:http://codeforces.com/contest/370/problem/B
我的英文真是差到一定程度了。。。看了半天没看懂,搜了题意。。
有n给人,每个人有m[i]张点数均不同的卡片,现在主持人没喊一个数持对应点数卡片的人能走卡片的步数,某人先走完自己手中全部卡片的获胜,问你在每个人都最有利的情况下每个人的获胜情况。
就是对每个人去其他人的卡片堆中找是否有自己卡片点数的子串,如果有自己就必输。
代码:
#include <cstdio>#include <cstring>#include <iostream>#include <set>using namespace std;const int MAX=105;int n,a[MAX],v;set<int>s[MAX];set<int>::iterator it;int main(){ scanf("%d",&n); for(int i=0;i<n;i++){ scanf("%d",&a[i]); for(int j=0;j<a[i];j++){ scanf("%d",&v); s[i].insert(v); } } for(int i=0;i<n;i++){ bool flag=true; for(int j=0;j<n;j++){ if(i==j) continue; bool ok=false; for(it=s[j].begin();it!=s[j].end();it++){ if(s[i].find(*it)==s[i].end()){ ok=true; break; } } if(ok==false){ flag=false; break; } } if(flag) printf("YES\n"); else printf("NO\n"); } return 0;}
- B. Berland Bingo----模拟
- CodeForces 370 B.Berland Bingo(模拟)
- Berland Bingo 【模拟】
- codeforces 370B Berland Bingo(强势模拟)
- CodeForces 370B. Berland Bingo
- Codeforces #217 (Div. 2) B. Berland Bingo
- Codeforces Round #217 (diy.2) B. Berland Bingo
- Codeforces Round #217 (Div. 2) / 370B Berland Bingo (set_union)
- CodeForces 567B Berland National Library 容器模拟
- Code Forces 567 B. Berland National Library(简单模拟)
- CodeForces 567B Berland National Library(模拟)(简单)
- B. Berland National Library
- Codeforces Round #Pi (Div. 2)567B Berland National Library(模拟)
- Codeforces Round #Pi (Div. 2) B. Berland National Library (模拟)
- bingo!
- 模拟 codeforces567B Berland National Library
- Codeforces B - Berland National Library
- Codeforces 370B Berland Bingog
- [python] 安装numpy+scipy+matlotlib+scikit-learn及问题解决
- android activity 窗口 样式
- csdn文章分类修改脚本
- 破除谷歌浏览器Google Chrome启动时打开hao123,2345等流氓网页
- 1087: [SCOI2005]互不侵犯King
- B. Berland Bingo----模拟
- android activity 生命周期
- 1406: [AHOI2007]密码箱
- 1711: [Usaco2007 Open]Dining吃饭
- UVA12396/HDU4196 Remoteland 素数拆分+快速求幂
- 1052: [HAOI2007]覆盖问题
- React Native利用ScrollableTabView实现Tab+ViewPager效果
- java读写Excel表格
- 3668: [Noi2014]起床困难综合症