Submission #992259
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pi M_PI
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
int p[100001],r[100001];
void init(){rep(i,100001)p[i]=i,r[i]=0;}
int find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));}
void unite(int x,int y) {
x=find(x),y=find(y);
if(x==y)return;
if(r[x]<r[y])p[x]=y;
else{p[y]=x;if(r[x]==r[y])r[x]++;}
}
bool same(int x,int y){return find(x)==find(y);}
void Main() {
init();
int n,m;
cin >> n >> m;
vector<int> v[m];
for(int i=0; i<n; i++) {
int k;
R k;
for(int j=0; j<k; j++) {
int x;
R x;
x--;
v[x].pb(i);
}
}
for(int i=0; i<m; i++) {
for(int j=0; j<v[i].size(); j++) unite(v[i][0],v[i][j]);
}
set<int> s;
for(int i=0; i<n; i++) s.in(find(i));
if(s.size()==1) pr("YES");
else pr("NO");
}
int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}
Submission Info
Submission Time |
|
Task |
C - Interpretation |
User |
kzyKT |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1860 Byte |
Status |
AC |
Exec Time |
29 ms |
Memory |
5376 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 |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
AC |
3 ms |
1024 KB |
01-02.txt |
AC |
4 ms |
1024 KB |
01-03.txt |
AC |
4 ms |
1152 KB |
01-04.txt |
AC |
4 ms |
1024 KB |
01-05.txt |
AC |
4 ms |
1024 KB |
01-06.txt |
AC |
4 ms |
1024 KB |
01-07.txt |
AC |
4 ms |
1024 KB |
01-08.txt |
AC |
4 ms |
1024 KB |
01-09.txt |
AC |
4 ms |
1024 KB |
01-10.txt |
AC |
4 ms |
1024 KB |
02-01.txt |
AC |
24 ms |
5376 KB |
02-02.txt |
AC |
19 ms |
1664 KB |
02-03.txt |
AC |
23 ms |
3584 KB |
02-04.txt |
AC |
28 ms |
4736 KB |
02-05.txt |
AC |
23 ms |
2048 KB |
02-06.txt |
AC |
29 ms |
4736 KB |
02-07.txt |
AC |
23 ms |
2048 KB |
02-08.txt |
AC |
16 ms |
1536 KB |
02-09.txt |
AC |
21 ms |
3964 KB |
02-10.txt |
AC |
20 ms |
4096 KB |
02-11.txt |
AC |
20 ms |
4096 KB |
02-12.txt |
AC |
21 ms |
3968 KB |
02-13.txt |
AC |
21 ms |
3840 KB |
sample-01.txt |
AC |
3 ms |
1024 KB |
sample-02.txt |
AC |
3 ms |
1024 KB |