CodeForces 370B. Berland Bingo

B. Berland Bingo

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

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

Sample test(s)

input

3
1 1
3 2 4 1
2 10 11

output

YES
NO
YES

input

2
1 1
1 1

output

NO
NO

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int n,m;

int map[120][120];
int vis[120];

int main()
{
    memset(vis,63,sizeof(vis));
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>m;
        while(m--)
        {
            int a;
            cin>>a;
            map[i][a]++;
        }
    }
    for(int i=0;i<n;i++)
    {
        ///任何其他玩家的不能是i的子集
        bool flag=true;
        for(int j=0;j<n;j++)
        {
            if(i==j) continue;
            bool flag1=true;
            for(int k=0;k<=101;k++)
            {
                if(map[j][k]>map[i][k])
                {
                    flag1=false; break;
                }
            }
            if(flag1)///j是i的子集
            {
                flag=false; break;
            }
        }
        if(!flag) vis[i]=0;
    }
    for(int i=0;i<n;i++)
    {
        if(vis[i]) puts("YES");
        else puts("NO");
    }
    return 0;
}