Submission #992577
Source Code Expand
#include <bits/stdc++.h> using namespace std; struct UnionFind { vector<int> data; UnionFind(int size) : data(size, -1) { } bool unionSet(int x, int y) { x = root(x); y = root(y); if (x != y) { if (data[y] < data[x]) swap(x, y); data[x] += data[y]; data[y] = x; } return x != y; } bool findSet(int x, int y) { return root(x) == root(y); } int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); } int size(int x) { return -data[root(x)]; } }; #define int long long #define range(i,x,y) i=(x);i<(y);i++ #define rep(i,n) for(int i=0,i##_len=n;i<i##_len;i++) #define all(x) begin(x),end(x) #define lim(x,r,l) (r<=x&&x<l) typedef long long ll; typedef long double ld; signed main(){ int n, m; cin >> n >> m; UnionFind uf(n); vector<vector<int>> merged(m, vector<int>()); rep(i,n){ int k; cin >> k; rep(j, k){ int l; cin >> l; merged[l-1].push_back(i); } } rep(l, m){ for(int i = 0; i < (signed) merged[l].size() - 1ll; i++){ uf.unionSet(merged[l][i], merged[l][i+1]); } } if(uf.size(0) == n){ cout << "YES" << endl; }else{ cout << "NO" << endl; } }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | wass80 |
Language | C++14 (Clang 3.8.0) |
Score | 0 |
Code Size | 1247 Byte |
Status | CE |
Compile Error
./Main.cpp:1:10: fatal error: 'bits/stdc++.h' file not found #include <bits/stdc++.h> ^ 1 error generated.