Submission #7336715

---

Source Code Expand

#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
#define NODE_MAX 100001
vector<ll> lg[NODE_MAX],hg[NODE_MAX];
ll lang_used[NODE_MAX]={},human_used[NODE_MAX]={};
void lang_dfs(ll p);
void human_dfs(ll p);

void human_dfs(ll p){
  if(human_used[p]){
    return;
  }
  human_used[p]=true;
  for(ll i=0;i<hg[p].size();i++){
    lang_dfs(hg[p][i]);
  }
}
void lang_dfs(ll p){
  if(lang_used[p]){
    return;
  }
  lang_used[p]=true;
  for(ll i=0;i<lg[p].size();i++){
    human_dfs(lg[p][i]);
  }
}
signed main(){
  ll n,m,tl;
  bool can=true;
  cin >> n >> m;
  ll k[n];
  for(int i=0;i<n;i++){
    cin >> k[i];
    for(int j=0;j<k[i];j++){
      cin >> tl;
      tl--;
      lg[tl].push_back(i);
      hg[i].push_back(tl);
    }
  }
  human_dfs(0);
  for(int i=0;i<n;i++){
    if(human_used[i]==false){
      can=false;
      break;
    }
  }
  if(can){
    cout <<"YES\n";
  }else{
    cout <<"NO\n";
  }
}

Submission Info

Judge Result