Submission #3631472

---

Source Code Expand

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

//#include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// using cint = cpp_int;

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = 1e9 + 7;
const ll INF = LONG_MAX;
const ull MAX = ULONG_MAX;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define endl '\n'
#define space ' '
#define def inline auto
#define func inline constexpr ll
#define run __attribute__((constructor)) def _
#define all(v) begin(v), end(v)
#define input(a) scanf("%lld", &(a))
#define print(a) printf("%lld\n", (a))

// Debug
#define debug(...)                                                             \
    {                                                                          \
        cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                     \
        for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] ";               \
        cerr << endl;                                                          \
    }

#define dump(a, h, w)                                                          \
    rep(i, h) {                                                                \
        rep(j, w) cerr << a[i][j] << space;                                    \
        cerr << endl;                                                          \
    }
#define lldump(a, n) dump(vector<vector<ll>>{a}, 1, n)

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define each(i, a) for (auto &&i : a)
#define rep(i, n) inc(i, 0, n - 1)
#define loop() for (;;)

// Stream
#define fout(n) cout << fixed << setprecision(n)
#define fasten cin.tie(0), ios::sync_with_stdio(0)

// Speed
run() { fasten, fout(10); }
#pragma GCC optimize("O3")
#pragma GCC optimization_level 3
#pragma GCC target("avx")

// Math
func gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
func lcm(ll a, ll b) { return a * b / gcd(a, b); }
func sign(ll a) { return a ? abs(a) / a : 0; }

def in() {
    ll A;
    cin >> A;
    return A;
}

struct UFT {
    vector<ll> parent;
    UFT(ll N) : parent(N) { rep(i, N) parent[i] = i; }
    def root(ll x) {
        if (parent[x] == x)
            return x;
        else
            return parent[x] = root(parent[x]);
    }
    def unite(ll x, ll y) {
        ll root_x = root(x), root_y = root(y);
        if (root_x != root_y) {
            if (root_x > root_y) swap(root_x, root_y);
            parent[root_x] = root_y;
        }
    }
    def same(ll x, ll y) { return root(x) == root(y); }
};

ll N, M;
vector<ll> K;
vector<vector<ll>> Language;
signed main() {
    cin >> N >> M;
    UFT uf(N);
    rep(i, M) Language.pb({});
    rep(i, N) {
        K.pb(in());
        rep(j, K[i]) Language[in() - 1].pb(i);
    }

    rep(i, M) {
        rep(j, Language[i].size() - 1)
            uf.unite(Language[i][j], Language[i][j + 1]);
    }

    rep(i, N - 1) if (!uf.same(i, i + 1)) return puts("NO") & 0;
    return puts("YES") & 0;
}

// for compilation: g++ -Ofast -march=native -o _ _.cpp -std=c++17

Submission Info

Judge Result