Submission #6904915
Source Code Expand
N,M=map(int,input().split()) L=[list(map(int,input().split())) for i in range(N)] class UnionFind: def __init__(self,N): self.Parent=[-1]*N def unite(self,m,n): rm=self.root(m) rn=self.root(n) if rm==rn: return False else: if self.size(rm)<self.size(rn): rm,rn=rn,rm self.Parent[rm]+=self.Parent[rn] self.Parent[rn]=rm return True def root(self,n): if self.Parent[n]<0: return n else: self.Parent[n]=self.root(self.Parent[n]) return self.Parent[n] def size(self,n): return -self.Parent[self.root(n)] u=UnionFind(M) used=[0]*M for _,*l in L: used[l[0]-1]=1 for i in range(len(l)-1): used[l[i+1]-1]=1 u.unite(l[i]-1,l[i+1]-1) print(['NO','YES'][u.size(L[0][1])==sum(used)])
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | st2d |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 918 Byte |
Status | RE |
Exec Time | 390 ms |
Memory | 25828 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | 0 / 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 | RE | 18 ms | 3064 KB |
01-02.txt | AC | 20 ms | 3064 KB |
01-03.txt | AC | 21 ms | 3188 KB |
01-04.txt | RE | 21 ms | 3188 KB |
01-05.txt | AC | 21 ms | 3188 KB |
01-06.txt | WA | 21 ms | 3188 KB |
01-07.txt | WA | 21 ms | 3064 KB |
01-08.txt | AC | 21 ms | 3188 KB |
01-09.txt | AC | 21 ms | 3188 KB |
01-10.txt | AC | 21 ms | 3188 KB |
02-01.txt | WA | 260 ms | 9288 KB |
02-02.txt | AC | 390 ms | 22900 KB |
02-03.txt | AC | 258 ms | 9204 KB |
02-04.txt | WA | 356 ms | 18224 KB |
02-05.txt | AC | 364 ms | 20812 KB |
02-06.txt | AC | 361 ms | 18252 KB |
02-07.txt | AC | 376 ms | 22636 KB |
02-08.txt | AC | 379 ms | 20980 KB |
02-09.txt | AC | 384 ms | 25828 KB |
02-10.txt | AC | 321 ms | 16704 KB |
02-11.txt | AC | 323 ms | 16668 KB |
02-12.txt | AC | 307 ms | 16220 KB |
02-13.txt | AC | 313 ms | 16204 KB |
sample-01.txt | AC | 17 ms | 3064 KB |
sample-02.txt | AC | 17 ms | 3064 KB |