#741184 (PyPy3) No.1805 Approaching Many Typhoon

• 問題: No.1805 Approaching Many Typhoon
• ユーザー: 89
• 提出日時: 2022-02-21 13:01:42
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 67 ms / 2,000 ms
• コード長: 1,764 bytes
• コンパイル時間: 223 ms
• コンパイル使用メモリ: 82,160 KB
• 実行使用メモリ: 71,976 KB
• 最終ジャッジ日時: 2024-06-29 17:29:42
• 合計ジャッジ時間: 3,421 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 4
other	AC * 35

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
from collections import defaultdict
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x
    def size(self, x):
        return -self.parents[self.find(x)]
    def same(self, x, y):
        return self.find(x) == self.find(y)
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]
    def group_count(self):
        return len(self.roots())
    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members
    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
n,m = map(int,input().split())
s,g = map(int,input().split())
ab = []
for i in range(m):
    z,x = map(int,input().split())
    ab.append([z,x])
u = int(input())
p = set(list(map(int,input().split())))
q = []
for i in range(m):
    if (ab[i][0] not in p) and (ab[i][1] not in p):
        q.append(ab[i])
P = UnionFind(n)
for i in range(len(q)):
    P.union(q[i][0]-1,q[i][1] - 1)
#print(s - 1,g - 1)
if P.same(s - 1,g - 1):
    print("Yes")
else:
    print("No")
#print(P)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX