Submission #1024066
Source Code Expand
#include <cstdio>
#include <algorithm>
#include <vector>
#define sz(x) x.size()
using namespace std;
const int maxn = 100010;
int fat[maxn], rnk[maxn];
vector <int> vec[maxn];
int find(int x){
if(fat[x] == x) return x;
return fat[x] = find(fat[x]);
}
void unit(int x,int y){
x = find(x);
y = find(y);
if(x == y) return;
if(rnk[x]>rnk[y]) swap(x,y);
if(rnk[x] == rnk[y]) rnk[y]++;
fat[x] = y;
}
int main(){
int n, m;
scanf("%d %d", &n, &m);
for(int i = 0; i < n; i++){
fat[i] = i;
rnk[i] = 0;
}
for(int i = 0; i < n; i++){
int t;
scanf("%d", &t);
for(int j = 0; j < t; j++){
int ax;
scanf("%d", &ax);
vec[ax].push_back(i);
}
}
for(int i = 1; i <= m; i++){
int siz = sz(vec[i]);
for(int j = 0; j < (siz - 1); j++){
unit(vec[i][j],vec[i][j+1]);
}
}
int resp = find(0);
int ok = 1;
for(int i = 1; i < n; i++){
if(resp != find(i)) ok = 0;
}
if(ok) puts("YES");
else puts("NO");
}
Submission Info
Submission Time |
|
Task |
C - Interpretation |
User |
kokosha |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1171 Byte |
Status |
AC |
Exec Time |
39 ms |
Memory |
4736 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:35:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &n, &m);
^
./Main.cpp:43:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &t);
^
./Main.cpp:46:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &ax);
^
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 |
4 ms |
2560 KB |
01-02.txt |
AC |
4 ms |
2560 KB |
01-03.txt |
AC |
5 ms |
2560 KB |
01-04.txt |
AC |
5 ms |
2688 KB |
01-05.txt |
AC |
4 ms |
2560 KB |
01-06.txt |
AC |
4 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 |
24 ms |
3840 KB |
02-03.txt |
AC |
24 ms |
4096 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 |
29 ms |
4096 KB |
02-08.txt |
AC |
39 ms |
3968 KB |
02-09.txt |
AC |
24 ms |
3964 KB |
02-10.txt |
AC |
23 ms |
4736 KB |
02-11.txt |
AC |
23 ms |
4736 KB |
02-12.txt |
AC |
24 ms |
4736 KB |
02-13.txt |
AC |
24 ms |
4608 KB |
sample-01.txt |
AC |
5 ms |
2560 KB |
sample-02.txt |
AC |
4 ms |
2560 KB |