Submission #992666
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define rep(i,s,t) for(int i = s; i <= t; ++ i)
const int MaxN = 100050;
int n, m;
vector<int> L[MaxN];
int K, LI, fa[MaxN];
int f(int x){return fa[x] == x?x:fa[x]=f(fa[x]);}
int main()
{
scanf("%d%d",&n,&m);
rep(i,1,n)
{
scanf("%d",&K);
rep(j,1,K)
{
scanf("%d",&LI);
L[LI].pb(i);
}
}
rep(i,1,n) fa[i] = i;
rep(i,1,m) if(L[i].size()>1) rep(j,1,L[i].size()-1) fa[f(L[i][j])]=f(L[i][j-1]);
rep(i,1,n) if(f(i) != f(1)) {puts("NO"); return 0;}
puts("YES");
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Interpretation |
User |
PSMao |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
658 Byte |
Status |
AC |
Exec Time |
31 ms |
Memory |
4608 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:16:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
./Main.cpp:19:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&K);
^
./Main.cpp:22:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&LI);
^
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 |
5 ms |
2560 KB |
01-02.txt |
AC |
5 ms |
2560 KB |
01-03.txt |
AC |
5 ms |
2560 KB |
01-04.txt |
AC |
5 ms |
2560 KB |
01-05.txt |
AC |
5 ms |
2560 KB |
01-06.txt |
AC |
5 ms |
2560 KB |
01-07.txt |
AC |
5 ms |
2560 KB |
01-08.txt |
AC |
5 ms |
2560 KB |
01-09.txt |
AC |
5 ms |
2560 KB |
01-10.txt |
AC |
5 ms |
2560 KB |
02-01.txt |
AC |
25 ms |
4608 KB |
02-02.txt |
AC |
23 ms |
3584 KB |
02-03.txt |
AC |
25 ms |
3968 KB |
02-04.txt |
AC |
31 ms |
4224 KB |
02-05.txt |
AC |
28 ms |
3712 KB |
02-06.txt |
AC |
29 ms |
4224 KB |
02-07.txt |
AC |
28 ms |
3712 KB |
02-08.txt |
AC |
21 ms |
3428 KB |
02-09.txt |
AC |
24 ms |
3448 KB |
02-10.txt |
AC |
23 ms |
4476 KB |
02-11.txt |
AC |
23 ms |
4476 KB |
02-12.txt |
AC |
23 ms |
4480 KB |
02-13.txt |
AC |
23 ms |
4480 KB |
sample-01.txt |
AC |
5 ms |
2560 KB |
sample-02.txt |
AC |
5 ms |
2560 KB |