結果

問題 No.1451 集団登校
コンテスト
ユーザー ansain
提出日時 2021-03-31 18:47:24
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 409 ms / 2,000 ms
コード長 3,243 bytes
コンパイル時間 321 ms
コンパイル使用メモリ 12,800 KB
実行使用メモリ 17,152 KB
最終ジャッジ日時 2024-12-15 06:19:06
合計ジャッジ時間 6,222 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import defaultdict
import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
# from math import isqrt, prod,comb  # python3.8用(notpypy)
#from bisect import bisect_left,bisect_right
#from functools import lru_cache,reduce
from heapq import heappush, heappop, heapify, heappushpop, heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError
# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)


# https://note.nkmk.me/python-union-find/から一部改変


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
        self.group_num = n
        self.tournament=[0]*n

    def find(self, x, y=0):
        if self.parents[x] < 0:
            return x, y+self.tournament[x]
        else:
            return self.find(self.parents[x], y+self.tournament[x])

    def union(self, x, y):
        x,_ = self.find(x)
        y,_ = self.find(y)

        if x == y:
            return

        self.group_num -= 1
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        if self.parents[x] == self.parents[y]:
            self.tournament[x] = 1
            self.tournament[y] = 1
            self.tournament.append(0)
            self.parents.append(self.parents[x]+self.parents[y])
            self.parents[x] = len(self.parents)-1
            self.parents[y] = len(self.parents)-1

        else:
            self.tournament[y] -= 10**9
            self.parents[x] += self.parents[y]
            self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

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

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return self.group_num

    def all_group_members(self):
        self.all_group_member = defaultdict(list)
        for i in range(self.n):
            self.all_group_member[self.find(i)].append(i)
        return self.all_group_member

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


def main():
    mod = 10**9+7
    mod2 = 998244353
    n,m=map(int, input().split())
    uf=UnionFind(n)
    for i in range(m):
        a,b=map(lambda x: int(x)-1, input().split())
        uf.union(a,b)
    #print(uf.tournament)
    for i in range(n):
        root,t=uf.find(i)
        if t>=0:
            print(pow(2,-t,mod))
        else:
            print(0)



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