Submission #992168

---

Source Code Expand

#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())


using namespace std;



int n,m;
bool visited[200000];
vector<int> edge[200000];


void dfs(int u){
	if (visited[u])return;
	visited[u]=true;
	for (int v:edge[u]){
		dfs(v);
	}
}


int main(){
	cin>>n>>m;
	rep(i,n){
		int k;
		cin>>k;
		rep(j,k){
			int L;
			cin>>L;
			L--;
			edge[i].push_back(n+L);
			edge[n + L].push_back(i);
		}
	}
	dfs(0);
	cout << (all_of(visited, visited + n, [](bool f){return f;})?"YES":"NO")<<endl;

	return 0;
}

Submission Info

Judge Result