Submission #11320110
Source Code Expand
#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE
class UF{
public:
Int V;
vector<Int> par,rnk,sz;
UF(){}
UF(Int V):V(V),par(V),rnk(V,0),sz(V,1){for(Int i=0;i<V;i++)par[i]=i;}
Int find(Int x){
assert(x < V);
if(par[x]==x)return x;
return par[x]=find(par[x]);
}
void unite(Int x,Int y){
x=find(x), y=find(y);
if(x==y)return;
if(rnk[x]<rnk[y])par[x]=y, sz[y] += sz[x];
else{
par[y]=x;
sz[x] += sz[y];
if(rnk[x]==rnk[y])rnk[x]++;
}
}
bool same(Int x,Int y){return find(x)==find(y);}
Int size(Int x){return sz[find(x)];}
};
signed main(){
srand((unsigned)time(NULL));
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
Int N, M;
cin>>N>>M;
UF uf(M);
set<Int> S;
for(Int i=0;i<N;i++){
Int K;
cin>>K;
vector<Int> L(K);
cin>>L;
for(Int &l:L)l--;
for(Int l:L) S.insert(l);
for(Int i=1;i<(Int)L.size();i++) uf.unite(L[0], L[i]);
}
//for(Int i=0;i<M;i++) pr(i, uf.size(i));
Int ans = uf.size(*S.begin()) == (Int)S.size();
cout<<(ans? "YES":"NO")<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Interpretation |
User |
haji |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
3024 Byte |
Status |
AC |
Exec Time |
43 ms |
Memory |
5632 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 |
2 ms |
384 KB |
01-03.txt |
AC |
2 ms |
384 KB |
01-04.txt |
AC |
1 ms |
256 KB |
01-05.txt |
AC |
2 ms |
256 KB |
01-06.txt |
AC |
2 ms |
256 KB |
01-07.txt |
AC |
2 ms |
256 KB |
01-08.txt |
AC |
2 ms |
256 KB |
01-09.txt |
AC |
2 ms |
256 KB |
01-10.txt |
AC |
1 ms |
256 KB |
02-01.txt |
AC |
42 ms |
5632 KB |
02-02.txt |
AC |
23 ms |
384 KB |
02-03.txt |
AC |
36 ms |
3456 KB |
02-04.txt |
AC |
43 ms |
4608 KB |
02-05.txt |
AC |
31 ms |
1024 KB |
02-06.txt |
AC |
42 ms |
4608 KB |
02-07.txt |
AC |
31 ms |
1024 KB |
02-08.txt |
AC |
16 ms |
256 KB |
02-09.txt |
AC |
19 ms |
2560 KB |
02-10.txt |
AC |
24 ms |
4224 KB |
02-11.txt |
AC |
23 ms |
4224 KB |
02-12.txt |
AC |
28 ms |
3584 KB |
02-13.txt |
AC |
28 ms |
3584 KB |
sample-01.txt |
AC |
1 ms |
256 KB |
sample-02.txt |
AC |
1 ms |
256 KB |