Submission #7345678

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <numeric>
#include <array>
#include <cmath>
#include <memory>
#include <queue>
#include <stack>
using namespace std;
//変数デバッグ
#define DEB(variable) cout << #variable << '=' << variable << endl

//for簡易表記(引数ミス防止)
#define FOR(LoopVariable,numberOFbegin,numberOFend) for (long long int LoopVariable = (numberOFbegin); (LoopVariable) < (numberOFend); (LoopVariable)++)
#define DEFOR(LoopVariable,numberOFbegin,numberOFend) for (long long int LoopVariable = (numberOFbegin)-1; (LoopVariable) >= (numberOFend); (LoopVariable)--)
#define REP(LoopVariable,numberOFend) for(long long int LoopVariable = 0;(LoopVariable)<(numberOFend);LoopVariable++)

constexpr long long int linf = numeric_limits<long long int>::max()-5;
constexpr int inf= numeric_limits<int>::max()-5;
constexpr long long int mod = 1000000007;

class Graph{
public:

Graph(long long int o_size){
    graph_size=o_size;
    node.resize(graph_size,0);
    edge.resize(graph_size);
}

long long int add_edge(long long int a,long long int b){
    edge[a].push_back(b);
    edge[b].push_back(a);
        
    return a+b;
}

long long int node_add(long long int i,long long int a){
    node[i]+=a;
    return node[i];
}

void dfs(long long int start){
    vector<bool> checked(graph_size,false);
    stack<long long int> st;
    st.push(start);
    while(st.size()){
        long long int where = st.top();
        //cout << "Unko" << endl;
        st.pop();
        checked[where] = true;

        node[where]++;
        
        
        
        //cout << where << endl;
        for(auto x:edge[where]){
            if(checked[x]==false){
                st.push( x);
               
            }
        }
        
    }

}

void print(long long int n){
REP(i,n){
    if(node[i]==0){
        cout << "NO" << endl;
        return;
    }
}
cout << "YES" << endl;
}


private:
vector<vector<long long int>> edge;
vector<long long int> node;
long long int graph_size;

};

int main(){

    long long int n,m,tmpa,tmpb;
    cin>>n>>m;
    Graph graph(n+m);
    REP(i,n){

        scanf("%lld",&tmpa);
        REP(j,tmpa){
            scanf("%lld", &tmpb);
            graph.add_edge(i,n+tmpb-1);
        }
    }

    graph.dfs(0);
    graph.print(n);

    return 0;
}

Submission Info

Judge Result