Submission #5379476

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll MOD = 1e9+7;

vector<int> G[100100];
vector<int> L[100100];
bool isvisit[100100];

void dfs(int v){
    isvisit[v] = true;
    //for(auto l : L[v]){
    //    for(auto next : G[l]) {
    for(int i = 0; i < L[v].size(); i++){
        int l = L[v][i];
        for(int j = 0; j < G[l].size(); j++) {
            int next = G[l][j];
            if(isvisit[next]) continue;
            dfs(next);
        }
    }
}

int main(){
    int N, M;
    cin >> N >> M;
    REP(i,N){
        int K;
        cin >> K;
        REP(j,K){
            int l;
            cin >> l;
            l--;
            L[i].push_back(l);
            G[l].push_back(i);
        }
    }

    dfs(0);

    bool ans = true;
    REP(i,N){
        if(!isvisit[i])
            ans = false;
    }

    if(ans)
        cout << "YES" << endl;
    else 
        cout << "NO" << endl;
    return 0;
}

Submission Info

Judge Result