結果

問題 No.1390 Get together
ユーザー hiragnhiragn
提出日時 2022-11-29 18:26:48
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
AC  
実行時間 1,065 ms / 2,000 ms
コード長 2,307 bytes
コンパイル時間 249 ms
コンパイル使用メモリ 13,056 KB
実行使用メモリ 55,656 KB
最終ジャッジ日時 2024-04-16 12:02:19
合計ジャッジ時間 19,420 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 35 ms
10,880 KB
testcase_01 AC 34 ms
11,008 KB
testcase_02 AC 33 ms
11,008 KB
testcase_03 AC 54 ms
11,776 KB
testcase_04 AC 46 ms
11,264 KB
testcase_05 AC 50 ms
11,520 KB
testcase_06 AC 46 ms
11,392 KB
testcase_07 AC 44 ms
11,264 KB
testcase_08 AC 45 ms
11,392 KB
testcase_09 AC 52 ms
11,776 KB
testcase_10 AC 31 ms
11,008 KB
testcase_11 AC 31 ms
11,008 KB
testcase_12 AC 31 ms
11,008 KB
testcase_13 AC 31 ms
11,008 KB
testcase_14 AC 31 ms
11,136 KB
testcase_15 AC 30 ms
11,008 KB
testcase_16 AC 909 ms
41,392 KB
testcase_17 AC 888 ms
22,016 KB
testcase_18 AC 912 ms
55,656 KB
testcase_19 AC 1,061 ms
40,760 KB
testcase_20 AC 1,043 ms
27,288 KB
testcase_21 AC 1,048 ms
27,576 KB
testcase_22 AC 1,017 ms
42,792 KB
testcase_23 AC 1,027 ms
42,796 KB
testcase_24 AC 992 ms
42,928 KB
testcase_25 AC 1,051 ms
41,408 KB
testcase_26 AC 1,058 ms
41,656 KB
testcase_27 AC 1,046 ms
41,412 KB
testcase_28 AC 1,065 ms
41,528 KB
testcase_29 AC 1,049 ms
41,396 KB
testcase_30 AC 1,039 ms
41,640 KB
testcase_31 AC 1,040 ms
41,644 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import defaultdict


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

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

    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 _ in range(self.n)]
        group_size = [0 for _ in range(self.n)]
        for i in range(self.n):
            leader_buf[i] = self.leader(i)
            group_size[leader_buf[i]] += 1
        result = [[] for _ 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 main():
    n, m = map(int, input().split())

    graph = defaultdict(list)
    for _ in range(n):
        b, c = map(int, input().split())
        b -= 1
        c -= 1
        graph[b].append(c)

    uf = UnionFind(n)
    for v in graph.values():
        for x, y in zip(v, v[1:]):
            uf.merge(x, y)

    cnt = [-1] * n
    for v in graph.values():
        cnt[uf.leader(v[0])] += 1

    ans = sum([x for x in cnt if x >= 1])
    print(ans)


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