Submission #1857070

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;



void dfs(vector<bool>& used, vector<vector<int> >& graph, int c, int n, int m){
    
    if(used[c]) return;
    used[c] = true;
    for(int i = 0; i < graph[c].size(); i++){
        dfs(used, graph, graph[c][i], n, m);
    }
}

int main(void){

    int n, m; cin >> n >> m;
    vector<vector<int> > graph(n + m + 1);  //隣接リスト
    for(int i = 1; i <= n; i++){
        int k; cin >> k;
        for(int j = 0; j < k; j++){
            int l; cin >> l;
            graph[i].push_back(l);
            graph[l + n].push_back(i);
        }
    }

    
    vector<bool> used(n + m + 1, false);
    dfs(used, graph, 1, n, m);

    bool flag = true;
    for(int i = 1; i <= n; i++){
        if(used[i] == false){
            flag = false;
            break;
        }
    }

    if(flag) cout << "YES" << endl;
    else cout << "NO" << endl;

    return 0;
}

Submission Info

Judge Result