Submission #7927870

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#define MAX_N 100001
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
vector<ll> Gh[MAX_N],Gl[MAX_N];
ll n,m,used_l[MAX_N]={},used_h[MAX_N]={};
void search_human(ll v);
void search_lang(ll v);

void search_human(ll v){
  if(used_h[v]){
    return;
  }
  used_h[v]=true;
  for(int i=0;i<Gh[v].size();i++){
    search_lang(Gh[v][i]);
  }
}
void search_lang(ll v){
  if(used_l[v]){
    return;
  }
  used_l[v]=true;
  for(int i=0;i<Gl[v].size();i++){
    search_human(Gl[v][i]);
  }
}
signed main(){
  ll k,l;
  bool can=true;
  cin >> n >> m;
  for(int i=0;i<n;i++){
    cin >> k;
    for(int j=0;j<k;j++){
      cin >> l;
      l--;
      Gh[i].push_back(l);
      Gl[l].push_back(i);
    }
  }
  search_human(0);
  for(int i=0;i<n;i++){
    if(used_h[i]==false){
      can=false;
      break;
    }
  }
  if(can){
    cout <<"YES\n";
  }else{
    cout <<"NO\n";
  }
}

Submission Info

Judge Result