Submission #2749501

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include<map>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <iomanip>
using namespace std;
#define MAX_MOD 1000000007
#define REP(i,n) for(int i = 0;i < n;++i)
int union_find[200000] = {};
vector<int> human[200000];
vector<int> language[200000];
int language_visited[200000] = {};
int union_search(int now){
	if(union_find[now] == now) return now;
	return union_find[now] = union_search(union_find[now]);
}
int union_merge(int a,int b){
	a = union_search(a);
	b = union_search(b);
	union_find[a] = b;
	return 0;
}
int main(){
	int n,m;
	cin >> n >> m;
	REP(i,n){
		int a;
		cin >> a;
		REP(q,a){
			int b;
			cin >> b;
			language[b].push_back(i);
			human[i].push_back(b);
		}
		union_find[i] = i;
	}
	for(int i = 0;i < n;++i){
		for(int q = 0;q < human[i].size();++q){
			if(language_visited[human[i][q]] == 0){
				language_visited[human[i][q]] = 1;
				for(int j = 0;j < language[human[i][q]].size();++j){
					union_merge(i,language[human[i][q]][j]);
				}
			}
		}
	}
	for(int i = 0;i < n;++i){
		if(union_search(i) != union_search(0)){
			cout << "NO" << endl;
			return 0;
		}
	}
	cout << "YES" << endl;
	return 0;
}

Submission Info

Judge Result