Submission #5017321
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+7;
int f[N];
int sf(int x){
return f[x]==x ? x : f[x] = sf(f[x]);
}
void un(int a,int b){
f[sf(a)] = sf(b);
}
vector<int> G[N];
int main()
{
int m,k,n,x;
for(int i=0;i<N;i++)f[i]=i;
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%d",&k);
while(k--){
scanf("%d",&x);
G[x].push_back(i);
}
}
int s;
for(int i=1;i<=m;i++){
s = G[i].size();
if(s>0) x=G[i][0];
for(int j=1;j<s;j++){
un(x,G[i][j]);
}
}
int f=sf(1);
for(int i=2;i<=n;i++){
if(f!=sf(i)){
puts("NO");
return 0;
}
}
puts("YES");
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Interpretation |
User |
vjudge3 |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
757 Byte |
Status |
AC |
Exec Time |
27 ms |
Memory |
5500 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:16:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&m);
^
./Main.cpp:18:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&k);
^
./Main.cpp:20:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&x);
^
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 |
3 ms |
2944 KB |
01-02.txt |
AC |
3 ms |
2944 KB |
01-03.txt |
AC |
3 ms |
2944 KB |
01-04.txt |
AC |
3 ms |
2944 KB |
01-05.txt |
AC |
3 ms |
2944 KB |
01-06.txt |
AC |
3 ms |
2944 KB |
01-07.txt |
AC |
3 ms |
2944 KB |
01-08.txt |
AC |
3 ms |
2944 KB |
01-09.txt |
AC |
3 ms |
2944 KB |
01-10.txt |
AC |
3 ms |
2944 KB |
02-01.txt |
AC |
22 ms |
4992 KB |
02-02.txt |
AC |
21 ms |
3584 KB |
02-03.txt |
AC |
22 ms |
4352 KB |
02-04.txt |
AC |
27 ms |
4352 KB |
02-05.txt |
AC |
25 ms |
3840 KB |
02-06.txt |
AC |
27 ms |
4352 KB |
02-07.txt |
AC |
26 ms |
3840 KB |
02-08.txt |
AC |
19 ms |
4324 KB |
02-09.txt |
AC |
22 ms |
5112 KB |
02-10.txt |
AC |
20 ms |
5500 KB |
02-11.txt |
AC |
20 ms |
5500 KB |
02-12.txt |
AC |
21 ms |
4736 KB |
02-13.txt |
AC |
20 ms |
4736 KB |
sample-01.txt |
AC |
3 ms |
2944 KB |
sample-02.txt |
AC |
3 ms |
2944 KB |