Submission #5570026
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
//const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod
class UnionFind
{
public:
vector<int> par;
vector<int> sz;
UnionFind(int N){
par = vector<int>(N);
REP(i, N) par[i] = i;
sz = vector<int>(N, 1);
}
int find(int x){
if(par[x] == x) return x;
else return par[x] = find(par[x]);
}
void unite(int x, int y){
x = find(x);
y = find(y);
if(x == y) return;
if(sz[x] < sz[y]) swap(x, y);
par[y] = x;
sz[x] += sz[y];
}
bool is_union(int x, int y){
x = find(x);
y = find(y);
return x == y;
}
int union_size(int x){
return sz[find(x)];
}
};
signed main(){
int N, M; cin >> N >> M;
vec K(N);
mat L(N);
mat ls(M);
REP(i, N){
cin >> K[i];
L[i] = vec(K[i]);
cin >> L[i];
REP(j, K[i]) ls[L[i][j] - 1].pb(i);
}
UnionFind UF(N);
REP(i, M){
if(SZ(ls[i])){
for(int p: ls[i]) UF.unite(p, ls[i][0]);
}
}
Ans(UF.union_size(0) == N, "YES", "NO");
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Interpretation |
User |
sumitacchan |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
3244 Byte |
Status |
AC |
Exec Time |
29 ms |
Memory |
11252 KB |
Judge Result
Set Name |
sample |
dataset1 |
dataset2 |
Score / Max Score |
0 / 0 |
200 / 200 |
200 / 200 |
Status |
|
|
|
Set Name |
Test Cases |
sample |
sample-01.txt, sample-02.txt |
dataset1 |
sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt |
dataset2 |
sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, sample-01.txt, sample-02.txt |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
AC |
1 ms |
256 KB |
01-02.txt |
AC |
1 ms |
256 KB |
01-03.txt |
AC |
1 ms |
384 KB |
01-04.txt |
AC |
1 ms |
384 KB |
01-05.txt |
AC |
1 ms |
384 KB |
01-06.txt |
AC |
1 ms |
384 KB |
01-07.txt |
AC |
1 ms |
384 KB |
01-08.txt |
AC |
1 ms |
384 KB |
01-09.txt |
AC |
1 ms |
384 KB |
01-10.txt |
AC |
1 ms |
384 KB |
02-01.txt |
AC |
23 ms |
5760 KB |
02-02.txt |
AC |
23 ms |
8960 KB |
02-03.txt |
AC |
22 ms |
4608 KB |
02-04.txt |
AC |
29 ms |
8704 KB |
02-05.txt |
AC |
26 ms |
8064 KB |
02-06.txt |
AC |
29 ms |
8704 KB |
02-07.txt |
AC |
28 ms |
8832 KB |
02-08.txt |
AC |
21 ms |
8816 KB |
02-09.txt |
AC |
24 ms |
11252 KB |
02-10.txt |
AC |
19 ms |
7672 KB |
02-11.txt |
AC |
19 ms |
7672 KB |
02-12.txt |
AC |
21 ms |
7552 KB |
02-13.txt |
AC |
21 ms |
7552 KB |
sample-01.txt |
AC |
1 ms |
256 KB |
sample-02.txt |
AC |
1 ms |
256 KB |