Codeforces Round #217 (Div. 2) / 370B Berland Bingo (set_union)

http://codeforces.com/contest/370/problem/B

/*15ms,200KB*/

#include<bits/stdc++.h>
using namespace std;

vector<int> v[105], tmp(105);

int main()
{
	int n, i, j, k, x;
	scanf("%d", &n);
	for (i = 0; i < n; ++i)
	{
		scanf("%d", &k);
		while (k--) scanf("%d", &x), v[i].push_back(x);
		sort(v[i].begin(), v[i].end());
	}
	for (i = 0; i < n; ++i)
	{
		for (j = 0; j < n; ++j)
		{
			if (j == i) continue;
			tmp.resize(set_union(v[i].begin(), v[i].end(), v[j].begin(), v[j].end(), tmp.begin()) - tmp.begin());
			if (tmp == v[i]) break;
		}
		puts(j == n ? "YES" : "NO");
	}
	return 0;
}