結果

問題 No.1983 [Cherry 4th Tune C] 南の島のマーメイド
ユーザー strangerxxxstrangerxxx
提出日時 2022-08-30 11:31:05
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 4,107 bytes
コンパイル時間 385 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 364,516 KB
最終ジャッジ日時 2024-11-07 06:45:19
合計ジャッジ時間 53,212 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
54,784 KB
testcase_01 AC 47 ms
54,528 KB
testcase_02 AC 47 ms
54,400 KB
testcase_03 AC 47 ms
54,784 KB
testcase_04 AC 47 ms
54,784 KB
testcase_05 AC 47 ms
54,656 KB
testcase_06 AC 47 ms
54,656 KB
testcase_07 AC 47 ms
54,784 KB
testcase_08 AC 238 ms
80,512 KB
testcase_09 AC 266 ms
81,408 KB
testcase_10 AC 278 ms
83,440 KB
testcase_11 AC 323 ms
89,596 KB
testcase_12 AC 286 ms
80,668 KB
testcase_13 AC 1,340 ms
138,808 KB
testcase_14 AC 1,488 ms
170,716 KB
testcase_15 AC 1,407 ms
125,288 KB
testcase_16 AC 795 ms
118,736 KB
testcase_17 AC 1,567 ms
181,324 KB
testcase_18 AC 1,183 ms
120,236 KB
testcase_19 AC 1,930 ms
263,288 KB
testcase_20 AC 1,220 ms
121,296 KB
testcase_21 AC 1,528 ms
174,964 KB
testcase_22 AC 1,813 ms
215,508 KB
testcase_23 AC 2,876 ms
353,628 KB
testcase_24 AC 2,687 ms
308,660 KB
testcase_25 AC 2,224 ms
228,544 KB
testcase_26 AC 2,509 ms
253,632 KB
testcase_27 AC 2,751 ms
334,440 KB
testcase_28 AC 2,499 ms
255,480 KB
testcase_29 AC 2,797 ms
308,656 KB
testcase_30 AC 2,463 ms
253,156 KB
testcase_31 AC 2,502 ms
255,728 KB
testcase_32 AC 2,552 ms
254,308 KB
testcase_33 AC 49 ms
54,784 KB
testcase_34 AC 711 ms
129,936 KB
testcase_35 RE -
testcase_36 AC 964 ms
112,796 KB
testcase_37 AC 48 ms
54,528 KB
testcase_38 AC 577 ms
78,336 KB
testcase_39 RE -
testcase_40 AC 1,096 ms
185,388 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 ** 5
    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 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