結果
問題 | No.1805 Approaching Many Typhoon |
ユーザー | Shirotsume |
提出日時 | 2022-01-12 20:17:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 64 ms / 2,000 ms |
コード長 | 2,052 bytes |
コンパイル時間 | 126 ms |
コンパイル使用メモリ | 82,240 KB |
実行使用メモリ | 73,096 KB |
最終ジャッジ日時 | 2024-04-27 12:54:32 |
合計ジャッジ時間 | 2,493 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
53,580 KB |
testcase_01 | AC | 34 ms
52,928 KB |
testcase_02 | AC | 34 ms
54,156 KB |
testcase_03 | AC | 33 ms
53,328 KB |
testcase_04 | AC | 32 ms
54,132 KB |
testcase_05 | AC | 34 ms
53,676 KB |
testcase_06 | AC | 33 ms
53,216 KB |
testcase_07 | AC | 34 ms
53,636 KB |
testcase_08 | AC | 34 ms
53,024 KB |
testcase_09 | AC | 34 ms
54,084 KB |
testcase_10 | AC | 32 ms
53,008 KB |
testcase_11 | AC | 32 ms
53,268 KB |
testcase_12 | AC | 33 ms
54,416 KB |
testcase_13 | AC | 33 ms
53,096 KB |
testcase_14 | AC | 33 ms
53,632 KB |
testcase_15 | AC | 33 ms
53,232 KB |
testcase_16 | AC | 35 ms
52,624 KB |
testcase_17 | AC | 35 ms
53,016 KB |
testcase_18 | AC | 33 ms
52,812 KB |
testcase_19 | AC | 34 ms
52,684 KB |
testcase_20 | AC | 32 ms
53,552 KB |
testcase_21 | AC | 34 ms
53,632 KB |
testcase_22 | AC | 33 ms
52,860 KB |
testcase_23 | AC | 34 ms
53,764 KB |
testcase_24 | AC | 35 ms
54,668 KB |
testcase_25 | AC | 33 ms
52,944 KB |
testcase_26 | AC | 35 ms
53,928 KB |
testcase_27 | AC | 34 ms
53,632 KB |
testcase_28 | AC | 60 ms
72,276 KB |
testcase_29 | AC | 64 ms
71,196 KB |
testcase_30 | AC | 62 ms
70,928 KB |
testcase_31 | AC | 61 ms
73,096 KB |
testcase_32 | AC | 36 ms
53,324 KB |
testcase_33 | AC | 37 ms
54,376 KB |
testcase_34 | AC | 40 ms
54,788 KB |
testcase_35 | AC | 47 ms
61,920 KB |
testcase_36 | AC | 52 ms
64,564 KB |
testcase_37 | AC | 36 ms
54,320 KB |
testcase_38 | AC | 36 ms
52,656 KB |
ソースコード
n, m = map(int,input().split()) s, g = map(int,input().split()) s -= 1; g -= 1 class dsu(): n=1 parent_or_size=[-1 for i in range(n)] def __init__(self,N): self.n=N self.parent_or_size=[-1 for i in range(N)] def merge(self,a,b): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n) x=self.leader(a) y=self.leader(b) if x==y: return x if (-self.parent_or_size[x]<-self.parent_or_size[y]): x,y=y,x self.parent_or_size[x]+=self.parent_or_size[y] self.parent_or_size[y]=x return x def same(self,a,b): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n) return self.leader(a)==self.leader(b) def leader(self,a): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) if (self.parent_or_size[a]<0): return a self.parent_or_size[a]=self.leader(self.parent_or_size[a]) return self.parent_or_size[a] def size(self,a): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) return -self.parent_or_size[self.leader(a)] def groups(self): leader_buf=[0 for i in range(self.n)] group_size=[0 for i in range(self.n)] for i in range(self.n): leader_buf[i]=self.leader(i) group_size[leader_buf[i]]+=1 result=[[] for i in range(self.n)] for i in range(self.n): result[leader_buf[i]].append(i) result2=[] for i in range(self.n): if len(result[i])>0: result2.append(result[i]) return result2 graph = [[] for _ in range(n)] uv = [list(map(int,input().split())) for _ in range(m)] u = int(input()) I = set(map(int,input().split())) U = dsu(n) for u, v in uv: if u in I or v in I: continue else: U.merge(u - 1, v - 1) print('Yes' if U.same(s, g) else 'No')