Berland Bingo 【模拟】

B. Berland Bingo
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Input
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.

Output
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.

Examples
input
3
1 1
3 2 4 1
2 10 11
output
YES
NO
YES
input
2
1 1
1 1
output
NO
NO

模拟，说白了就是暴力 TAT 。
感觉我写的有点繁琐了
代码

#include<bits/stdc++.h>
#define LL long long
using namespace std;
inline int read(){
    int f=1,x=0;char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') {x=x*10+ch-'0';ch=getchar();}
    return f*x;
}

/*------------------------------*/
const int MAXN = 100+10;
const int MAXM = 1E8;
struct Man{
    int num;
    int ka[MAXN];
}man[MAXN];
map<int,int>mp[MAXN];
int main()
{
    int n;cin>>n;
    for(int i=1;i<=n;i++){
        scanf("%d",&man[i].num);
        for(int j=0;j<man[i].num;j++){
            scanf("%d",&man[i].ka[j]);
            mp[i][man[i].ka[j]]=1;
        }

    }
    for(int i=1;i<=n;i++){
        int flag=1;
        for(int j=1;j<=n;j++){
            if(i==j) continue;
            if(man[i].num<man[j].num) continue;
            int cnt=0;
            for(int k=0;k<man[i].num;k++){
                if(mp[j][man[i].ka[k]]==1) cnt++;
            }
            if(man[i].num==man[j].num) {
                if(cnt==man[i].num) {
                    flag=0;
                    break;
                }
            }else {
                if(cnt==man[j].num) {
                    flag=0;
                    break;
                }
            }
        }
    if(flag) puts("YES");
    else puts("NO");
    }
    return 0;
}