Submission #5445744

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())//vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define LINF 1e18
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;

typedef vector<unsigned int>vec;
typedef vector<vec> mat;
//typedef tuple<ll, ll, ll> T;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }


int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
vector<vector<int>> edge;
vector<bool> visit;

void dfs(int n){
    if(visit[n]) return;
    visit[n]=true;
    for(int i=0;i<edge[n].size();i++){
        dfs(edge[n][i]);
    }
}
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,M;
    cin>>N>>M;
    edge.resize(N+M);
    REP(i,N){
        int k;cin>>k;
        edge[i].resize(k);
        REP(j,k){
            int l;cin>>l;
            l+=N-1;
            edge[i][j]=l;
            edge[l].push_back(i);
        }
    }
    visit.resize(N+M);
    dfs(0);
    REP(i,N) if(!visit[i]){
        cout<<"NO"<<endl;
        return 0;
    }
    cout<<"YES"<<endl;
}

Submission Info

Judge Result