Submission #992532
Source Code Expand
#include <bits/stdc++.h> using namespace std; int N, M; int f[100001]; int A[100001]; bool use[100001]; int find(int u) { if(u!=f[u]) f[u]=find(f[u]); return f[u]; } int main() { scanf("%d%d", &N, &M); for(int i=1; i<=M; i++) f[i]=i; int root=0; for(int i=0; i<N; i++) { int K; scanf("%d", &K); for(int j=0; j<K; j++) { scanf("%d", A+j); use[A[j]]=true; root=A[j]; if(j>0) f[find(A[j-1])]=find(A[j]); } } bool ok=true; for(int i=1; i<=M; i++) if(use[i]) ok&=find(i)==find(root); printf(ok?"YES\n":"NO\n"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | FatalEagle |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 739 Byte |
Status | AC |
Exec Time | 20 ms |
Memory | 1536 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:19:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &N, &M); ^ ./Main.cpp:26:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &K); ^ ./Main.cpp:29:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", A+j); ^
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 | 3 ms | 256 KB |
01-02.txt | AC | 3 ms | 256 KB |
01-03.txt | AC | 3 ms | 256 KB |
01-04.txt | AC | 3 ms | 256 KB |
01-05.txt | AC | 3 ms | 256 KB |
01-06.txt | AC | 3 ms | 256 KB |
01-07.txt | AC | 3 ms | 256 KB |
01-08.txt | AC | 3 ms | 256 KB |
01-09.txt | AC | 3 ms | 256 KB |
01-10.txt | AC | 3 ms | 256 KB |
02-01.txt | AC | 17 ms | 768 KB |
02-02.txt | AC | 18 ms | 256 KB |
02-03.txt | AC | 16 ms | 512 KB |
02-04.txt | AC | 19 ms | 768 KB |
02-05.txt | AC | 18 ms | 256 KB |
02-06.txt | AC | 19 ms | 768 KB |
02-07.txt | AC | 18 ms | 256 KB |
02-08.txt | AC | 17 ms | 256 KB |
02-09.txt | AC | 20 ms | 640 KB |
02-10.txt | AC | 17 ms | 1536 KB |
02-11.txt | AC | 17 ms | 1408 KB |
02-12.txt | AC | 17 ms | 768 KB |
02-13.txt | AC | 16 ms | 768 KB |
sample-01.txt | AC | 3 ms | 256 KB |
sample-02.txt | AC | 3 ms | 256 KB |