結果

問題 No.3200 Sinking Islands
ユーザー 👑 loop0919
提出日時 2025-07-11 22:13:33
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,039 ms / 2,000 ms
コード長 2,653 bytes
コンパイル時間 196 ms
コンパイル使用メモリ 82,568 KB
実行使用メモリ 150,428 KB
最終ジャッジ日時 2025-07-11 22:13:59
合計ジャッジ時間 17,197 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff # 

class dsu:
    n = 1
    parent_or_size = [-1 for i in range(n)]

    def __init__(self, N):
        self.n = N
        self.parent_or_size = [-1 for i in range(N)]

    def merge(self, a, b):
        assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
        assert 0 <= b < self.n, "0<=b<n,b={0},n={1}".format(b, self.n)
        x = self.leader(a)
        y = self.leader(b)
        if x == y:
            return x
        if -self.parent_or_size[x] < -self.parent_or_size[y]:
            x, y = y, x
        self.parent_or_size[x] += self.parent_or_size[y]
        self.parent_or_size[y] = x
        return x

    def same(self, a, b):
        assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
        assert 0 <= b < self.n, "0<=b<n,b={0},n={1}".format(b, self.n)
        return self.leader(a) == self.leader(b)

    def leader(self, a):
        assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
        if self.parent_or_size[a] < 0:
            return a
        self.parent_or_size[a] = self.leader(self.parent_or_size[a])
        return self.parent_or_size[a]

    def size(self, a):
        assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
        return -self.parent_or_size[self.leader(a)]

    def groups(self):
        leader_buf = [0 for i in range(self.n)]
        group_size = [0 for i in range(self.n)]
        for i in range(self.n):
            leader_buf[i] = self.leader(i)
            group_size[leader_buf[i]] += 1
        result = [[] for i in range(self.n)]
        for i in range(self.n):
            result[leader_buf[i]].append(i)
        result2 = []
        for i in range(self.n):
            if len(result[i]) > 0:
                result2.append(result[i])
        return result2


def solve():
    N, M = map(int, input().split())
    edges = [tuple(map(lambda x: int(x) - 1, input().split())) for _ in range(M)]

    Q = int(input())
    queries = [int(input()) - 1 for _ in range(Q)]

    uf = dsu(N)
    set_queries = set(queries)

    for i in range(M):
        if i not in set_queries:
            u, v = edges[i]
            uf.merge(u, v)

    curr_ans = N * (N - 1) // 2 - sum([len(g) * (len(g) - 1) // 2 for g in uf.groups()])

    answers = [None] * Q

    for i in range(Q - 1, -1, -1):
        answers[i] = curr_ans

        u, v = edges[queries[i]]

        if not uf.same(u, v):
            curr_ans += uf.size(u) * (uf.size(u) - 1) // 2
            curr_ans += uf.size(v) * (uf.size(v) - 1) // 2
            uf.merge(u, v)
            curr_ans -= uf.size(u) * (uf.size(u) - 1) // 2

    print(*answers, sep="\n")


if __name__ == "__main__":
    solve()
0