Submission #993235
Source Code Expand
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int UF[110000];
int FIND(int a){
if(UF[a]<0)return a;
return UF[a]=FIND(UF[a]);
}
void UNION(int a,int b){
a=FIND(a);b=FIND(b);if(a==b)return;
UF[a]+=UF[b];UF[b]=a;
}
vector<int>g[110000];
int main(){
int a,b;scanf("%d%d",&a,&b);
for(int i=0;i<a;i++){
int c;scanf("%d",&c);
for(int j=0;j<c;j++){
int d;scanf("%d",&d);d--;
g[d].push_back(i);
}
}
for(int i=0;i<a;i++)UF[i]=-1;
for(int i=0;i<b;i++){
for(int j=0;j+1<g[i].size();j++){
UNION(g[i][j],g[i][j+1]);
}
}
if(-UF[FIND(0)]==a)printf("YES\n");
else printf("NO\n");
}
Submission Info
Submission Time
2016-11-26 13:42:50+0900
Task
C - Interpretation
User
tozangezan
Language
C++14 (GCC 5.4.1)
Score
400
Code Size
657 Byte
Status
AC
Exec Time
30 ms
Memory
4864 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:16:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int a,b;scanf("%d%d",&a,&b);
^
./Main.cpp:18:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int c;scanf("%d",&c);
^
./Main.cpp:20:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int d;scanf("%d",&d);d--;
^
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
2816 KB
01-02.txt
AC
5 ms
2816 KB
01-03.txt
AC
5 ms
2816 KB
01-04.txt
AC
5 ms
2816 KB
01-05.txt
AC
5 ms
2816 KB
01-06.txt
AC
5 ms
2816 KB
01-07.txt
AC
5 ms
2816 KB
01-08.txt
AC
5 ms
2816 KB
01-09.txt
AC
5 ms
2816 KB
01-10.txt
AC
5 ms
2816 KB
02-01.txt
AC
25 ms
4864 KB
02-02.txt
AC
23 ms
3712 KB
02-03.txt
AC
25 ms
4224 KB
02-04.txt
AC
30 ms
4352 KB
02-05.txt
AC
28 ms
3968 KB
02-06.txt
AC
30 ms
4352 KB
02-07.txt
AC
28 ms
3968 KB
02-08.txt
AC
22 ms
3684 KB
02-09.txt
AC
24 ms
3704 KB
02-10.txt
AC
23 ms
4732 KB
02-11.txt
AC
23 ms
4732 KB
02-12.txt
AC
23 ms
4736 KB
02-13.txt
AC
23 ms
4736 KB
sample-01.txt
AC
5 ms
2816 KB
sample-02.txt
AC
5 ms
2816 KB