結果

問題 No.1983 [Cherry 4th Tune C] 南の島のマーメイド
ユーザー strangerxxxstrangerxxx
提出日時 2022-08-30 11:24:02
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
AC  
実行時間 3,997 ms / 4,000 ms
コード長 4,115 bytes
コンパイル時間 169 ms
コンパイル使用メモリ 11,240 KB
実行使用メモリ 198,760 KB
最終ジャッジ日時 2023-10-08 00:09:02
合計ジャッジ時間 66,074 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 20 ms
9,108 KB
testcase_01 AC 20 ms
9,008 KB
testcase_02 AC 20 ms
8,968 KB
testcase_03 AC 20 ms
9,016 KB
testcase_04 AC 20 ms
8,968 KB
testcase_05 AC 21 ms
9,056 KB
testcase_06 AC 20 ms
9,096 KB
testcase_07 AC 20 ms
9,088 KB
testcase_08 AC 73 ms
10,296 KB
testcase_09 AC 138 ms
11,400 KB
testcase_10 AC 132 ms
15,772 KB
testcase_11 AC 146 ms
15,300 KB
testcase_12 AC 93 ms
11,328 KB
testcase_13 AC 2,139 ms
68,764 KB
testcase_14 AC 2,449 ms
89,880 KB
testcase_15 AC 2,607 ms
66,044 KB
testcase_16 AC 1,964 ms
53,916 KB
testcase_17 AC 2,487 ms
95,068 KB
testcase_18 AC 2,264 ms
61,624 KB
testcase_19 AC 2,872 ms
125,292 KB
testcase_20 AC 2,302 ms
63,360 KB
testcase_21 AC 2,506 ms
100,304 KB
testcase_22 AC 2,790 ms
117,508 KB
testcase_23 AC 3,918 ms
141,192 KB
testcase_24 AC 3,936 ms
140,924 KB
testcase_25 AC 3,962 ms
141,096 KB
testcase_26 AC 3,921 ms
140,932 KB
testcase_27 AC 3,893 ms
140,976 KB
testcase_28 AC 3,887 ms
140,976 KB
testcase_29 AC 3,950 ms
141,196 KB
testcase_30 AC 3,989 ms
141,080 KB
testcase_31 AC 3,997 ms
141,084 KB
testcase_32 AC 3,966 ms
140,940 KB
testcase_33 AC 21 ms
9,092 KB
testcase_34 AC 2,418 ms
63,588 KB
testcase_35 AC 2,971 ms
198,736 KB
testcase_36 AC 2,555 ms
58,944 KB
testcase_37 AC 20 ms
9,056 KB
testcase_38 AC 1,227 ms
9,108 KB
testcase_39 AC 3,277 ms
198,760 KB
testcase_40 AC 3,011 ms
162,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def resolve():
    n, m, q = map(int, input().split())
    edges = [[] for _ in range(n)]
    uf = UnionFind(n)
    for _ in range(m):
        u, v = map(lambda x: int(x) - 1, input().split())
        edges[u].append(v)
        edges[v].append(u)
        uf.union(u, v)
    u = UnionFind(n)
    for v in uf.all_group_members().values():
        d = {j: i for i, j in enumerate(v)}
        edge = [[] for _ in range(len(v))]
        for i, j in enumerate(v):
            for k in edges[j]:
                edge[i].append(d[k])
        bridge, _ = bridge_detection(edge)
        for i, j in bridge:
            u.union(v[i], v[j])
    for _ in range(q):
        x, y = map(lambda x: int(x) - 1, input().split())
        if u.same(x, y):
            print("Yes")
        else:
            print("No")


def bridge_detection(graph, start=0):
    # 橋、二重辺連結成分
    import sys
    RECURSION_LIMIT = 10 ** 6
    sys.setrecursionlimit(RECURSION_LIMIT)
    n = len(graph)
    order = [-1] * n
    bridges = []
    cycle_graph = [set() for _ in range(n)]
    cnt = -1

    def dfs(u, prev):
        nonlocal cnt
        cnt += 1
        low_pt = order[u] = cnt
        for v in graph[u]:
            if v == prev:
                continue
            if order[v] == -1:
                v_low_pt = dfs(v, u)
                if v_low_pt > order[u]:
                    bridges.append(tuple(sorted([u, v])))
                else:
                    cycle_graph[u].add(v)
                    cycle_graph[v].add(u)
                low_pt = min(low_pt, v_low_pt)
            else:
                low_pt = min(low_pt, order[v])
                cycle_graph[u].add(v)
                cycle_graph[v].add(u)
        return low_pt
    dfs(start, -1)
    return sorted(bridges), cycle_graph


class UnionFind:
    def __init__(self, n: int) -> None:
        self.n = n
        self.parent = [-1] * n
        self.groups = n

    def find(self, x: int) -> int:
        if self.parent[x] < 0:
            return x
        else:
            p = x
            while self.parent[p] >= 0:
                p = self.parent[p]
            while self.parent[x] >= 0:
                self.parent[x], x = p, self.parent[x]
            return p

    def union(self, x: int, y: int) -> bool:
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if self.parent[x] > self.parent[y]:
            x, y = y, x
        self.parent[x] += self.parent[y]
        self.parent[y] = x
        self.groups -= 1
        return True

    def union_right(self, x: int, y: int) -> bool:
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if y > x:
            x, y = y, x
        self.parent[x] += self.parent[y]
        self.parent[y] = x
        self.groups -= 1
        return True

    def union_left(self, x: int, y: int) -> bool:
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if x > y:
            x, y = y, x
        self.parent[x] += self.parent[y]
        self.parent[y] = x
        self.groups -= 1
        return True

    def size(self, x: int) -> int:
        return -self.parent[self.find(x)]

    def same(self, x: int, y: int) -> bool:
        return self.find(x) == self.find(y)

    def members(self, x: int) -> list:
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self) -> list:
        return [i for i, x in enumerate(self.parent) if x < 0]

    def group_count(self) -> int:
        return self.groups

    def sizes(self) -> dict:
        return {i: -x for i, x in enumerate(self.parent) if x < 0}

    def all_group_members(self) -> dict:
        from collections import defaultdict
        d = defaultdict(list)
        for i in range(self.n):
            p = self.find(i)
            d[p].append(i)
        return d

    def __str__(self) -> str:
        return '\n'.join('{}: {}'.format(k, v)
                         for k, v in self.all_group_members().items())


if __name__ == '__main__':
    resolve()
0