結果

問題 No.1983 [Cherry 4th Tune C] 南の島のマーメイド
ユーザー strangerxxxstrangerxxx
提出日時 2022-09-16 16:24:40
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,292 ms / 4,000 ms
コード長 4,113 bytes
コンパイル時間 573 ms
コンパイル使用メモリ 87,100 KB
実行使用メモリ 189,564 KB
最終ジャッジ日時 2023-08-23 10:59:25
合計ジャッジ時間 32,047 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 98 ms
71,540 KB
testcase_01 AC 96 ms
71,276 KB
testcase_02 AC 97 ms
71,440 KB
testcase_03 AC 95 ms
71,436 KB
testcase_04 AC 95 ms
71,172 KB
testcase_05 AC 94 ms
71,560 KB
testcase_06 AC 94 ms
71,460 KB
testcase_07 AC 95 ms
71,708 KB
testcase_08 AC 234 ms
79,808 KB
testcase_09 AC 274 ms
84,804 KB
testcase_10 AC 267 ms
83,824 KB
testcase_11 AC 294 ms
83,984 KB
testcase_12 AC 295 ms
82,048 KB
testcase_13 AC 761 ms
119,708 KB
testcase_14 AC 845 ms
127,780 KB
testcase_15 AC 851 ms
122,808 KB
testcase_16 AC 598 ms
125,168 KB
testcase_17 AC 888 ms
132,700 KB
testcase_18 AC 804 ms
117,792 KB
testcase_19 AC 1,070 ms
157,640 KB
testcase_20 AC 802 ms
120,000 KB
testcase_21 AC 955 ms
137,628 KB
testcase_22 AC 1,028 ms
140,520 KB
testcase_23 AC 1,237 ms
161,720 KB
testcase_24 AC 1,292 ms
160,684 KB
testcase_25 AC 1,237 ms
161,668 KB
testcase_26 AC 1,217 ms
162,048 KB
testcase_27 AC 1,241 ms
160,336 KB
testcase_28 AC 1,224 ms
161,072 KB
testcase_29 AC 1,222 ms
162,068 KB
testcase_30 AC 1,232 ms
160,496 KB
testcase_31 AC 1,223 ms
161,452 KB
testcase_32 AC 1,216 ms
160,752 KB
testcase_33 AC 94 ms
71,580 KB
testcase_34 AC 397 ms
126,864 KB
testcase_35 AC 477 ms
163,600 KB
testcase_36 AC 509 ms
113,560 KB
testcase_37 AC 99 ms
71,716 KB
testcase_38 AC 231 ms
79,224 KB
testcase_39 AC 590 ms
177,576 KB
testcase_40 AC 626 ms
189,564 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def resolve():
    import sys
    input = sys.stdin.readline
    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(edges, start=0):
    n = len(edges)
    ord = [-1] * n
    order = ord[:]
    low = ord[:]
    q = [(start, -1)]
    cnt = 0
    edge = [[] for _ in range(n)]
    while q:
        i, pos = q.pop()
        if ord[i] >= 0:
            edge[i].append(pos)
            continue
        if pos >= 0:
            edge[pos].append(i)
        ord[i] = cnt
        order[cnt] = i
        cnt += 1
        for j in reversed(edges[i]):
            if j == pos or ord[j] >= 0:
                continue
            q.append((j, i))
    for i, j in enumerate(reversed(order)):
        low[j] = n - i - 1
        for k in edge[j]:
            if ord[k] < low[j]:
                low[j] = ord[k]
            if low[k] >= 0 and low[k] < low[j]:
                low[j] = low[k]
    bridges = []
    for i, j in enumerate(edge):
        for k in j:
            if ord[i] < low[k]:
                bridges.append((i, k))
    return bridges


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