Submission #1680057
Source Code Expand
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define getmid(l,r) ((l) + ((r) - (l)) / 2)
#define MEM(a,b) memset(a,b,sizeof(a))
#define MP(a,b) make_pair(a,b)
#define PB push_back
typedef long long ll;
typedef pair<int,int> pii;
const double eps = 1e-8;
const int INF = (1 << 30) - 1;
vector<int> V[100010];
int fa[100010];
int Find(int x){
return fa[x] == x ? x : fa[x] = Find(fa[x]);
}
int main(){
int N,M;
scanf("%d%d",&N,&M);
for(int i = 1; i <= N; ++i){
int K;
scanf("%d",&K);
for(int j = 1; j <= K; ++j){
int a;
scanf("%d",&a);
V[a].PB(i);
}
fa[i] = i;
}
for(int i = 1; i <= M; ++i){
if(V[i].size() == 0) continue;
int x = Find(V[i][0]);
for(int j = 1; j < V[i].size(); ++j){
int y = Find(V[i][j]);
//printf("%d %d\n",V[i][0],V[i][j]);
if(x != y){
fa[y] = x;
}
}
}
int num = 0;
for(int i = 1; i <= N; ++i){
if(fa[i] == i) num++;
}
if(num == 1){
printf("YES\n");
}
else printf("NO\n");
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Interpretation |
User |
Natureal |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1248 Byte |
Status |
AC |
Exec Time |
28 ms |
Memory |
4608 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:35:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&N,&M);
^
./Main.cpp:38:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&K);
^
./Main.cpp:41:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&a);
^
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 |
2560 KB |
01-02.txt |
AC |
3 ms |
2560 KB |
01-03.txt |
AC |
3 ms |
2560 KB |
01-04.txt |
AC |
3 ms |
2560 KB |
01-05.txt |
AC |
3 ms |
2560 KB |
01-06.txt |
AC |
3 ms |
2560 KB |
01-07.txt |
AC |
3 ms |
2560 KB |
01-08.txt |
AC |
3 ms |
2560 KB |
01-09.txt |
AC |
3 ms |
2560 KB |
01-10.txt |
AC |
3 ms |
2560 KB |
02-01.txt |
AC |
22 ms |
4608 KB |
02-02.txt |
AC |
21 ms |
3584 KB |
02-03.txt |
AC |
23 ms |
3968 KB |
02-04.txt |
AC |
28 ms |
4224 KB |
02-05.txt |
AC |
24 ms |
3712 KB |
02-06.txt |
AC |
28 ms |
4224 KB |
02-07.txt |
AC |
26 ms |
3712 KB |
02-08.txt |
AC |
18 ms |
3556 KB |
02-09.txt |
AC |
21 ms |
3452 KB |
02-10.txt |
AC |
20 ms |
4604 KB |
02-11.txt |
AC |
20 ms |
4480 KB |
02-12.txt |
AC |
21 ms |
4480 KB |
02-13.txt |
AC |
22 ms |
4480 KB |
sample-01.txt |
AC |
3 ms |
2560 KB |
sample-02.txt |
AC |
3 ms |
2560 KB |