1
class UF:
2
    # 连通分量个数
3
    _count: int
4
    # 每个节点的父节点
5
    parent: List[int]
6

7
    def __init__(self, n: int):
8
        self._count = n
9
        self.parent = [i for i in range(n)]
10

11
    # 合并两个集合
12
    def union(self, p: int, q: int):
13
        rootP = self.find(p)
14
        rootQ = self.find(q)
15
        if rootP == rootQ:
16
            return
17
        self.parent[rootQ] = rootP
18
        self._count -= 1
19

20
    # 判断是否连通
21
    def connected(self, p: int, q: int) -> bool:
22
        return self.find(p) == self.find(q)
23

24
    # 查找根节点，带路径压缩
25
    def find(self, x: int) -> int:
26
        if self.parent[x] != x:
27
            self.parent[x] = self.find(self.parent[x])
28
        return self.parent[x]
29

30
    # 返回当前连通分量个数
31
    def count(self) -> int:
32
        return self._count

1
import sys
2
from typing import List
3

4
class UF:
5
    _count: int
6
    parent: List[int]
7

8
    def __init__(self, n: int):
9
        self._count = n
10
        self.parent = [i for i in range(n)]
11

12
    def union(self, p: int, q: int):
13
        rootP = self.find(p)
14
        rootQ = self.find(q)
15
        if rootP == rootQ:
16
            return
17
        self.parent[rootQ] = rootP
18
        self._count -= 1
19

20
    def connected(self, p: int, q: int) -> bool:
21
        return self.find(p) == self.find(q)
22

23
    def find(self, x: int) -> int:
24
        if self.parent[x] != x:
25
            self.parent[x] = self.find(self.parent[x])
26
        return self.parent[x]
27

28
    def count(self) -> int:
29
        return self._count
30

31
def main():
32
    data = sys.stdin.read().strip().split()
33
    N, M = int(data[0]), int(data[1])
34
    edges = data[2:2 + 2*M]
35
    source, destination = int(data[2 + 2*M]), int(data[3 + 2*M])
36

37
    uf = UF(N)
38
    # 并查集节点从 0 开始，题中编号从 1 开始
39
    for i in range(0, 2*M, 2):
40
        s, t = int(edges[i]) - 1, int(edges[i+1]) - 1
41
        uf.union(s, t)
42

43
    # 判断 source 和 destination 是否连通
44
    if uf.connected(source - 1, destination - 1):
45
        print(1)
46
    else:
47
        print(0)
48

49
if __name__ == "__main__":
50
    main()