結果

問題 No.2214 Products on Tree
ユーザー ShirotsumeShirotsume
提出日時 2022-11-25 10:23:17
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,542 ms / 3,000 ms
コード長 3,520 bytes
コンパイル時間 304 ms
コンパイル使用メモリ 82,408 KB
実行使用メモリ 443,172 KB
最終ジャッジ日時 2024-04-16 13:38:08
合計ジャッジ時間 29,518 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
55,040 KB
testcase_01 AC 42 ms
55,168 KB
testcase_02 AC 196 ms
76,800 KB
testcase_03 AC 997 ms
158,092 KB
testcase_04 AC 1,027 ms
158,456 KB
testcase_05 AC 974 ms
151,396 KB
testcase_06 AC 684 ms
127,916 KB
testcase_07 AC 255 ms
91,776 KB
testcase_08 AC 208 ms
86,912 KB
testcase_09 AC 317 ms
98,720 KB
testcase_10 AC 654 ms
127,568 KB
testcase_11 AC 389 ms
104,064 KB
testcase_12 AC 447 ms
108,420 KB
testcase_13 AC 1,094 ms
162,224 KB
testcase_14 AC 1,041 ms
160,400 KB
testcase_15 AC 1,048 ms
161,600 KB
testcase_16 AC 1,060 ms
159,200 KB
testcase_17 AC 1,025 ms
158,248 KB
testcase_18 AC 758 ms
133,980 KB
testcase_19 AC 843 ms
140,496 KB
testcase_20 AC 750 ms
134,140 KB
testcase_21 AC 579 ms
121,216 KB
testcase_22 AC 1,036 ms
157,412 KB
testcase_23 AC 44 ms
56,012 KB
testcase_24 AC 43 ms
56,264 KB
testcase_25 AC 42 ms
56,440 KB
testcase_26 AC 43 ms
56,668 KB
testcase_27 AC 41 ms
56,032 KB
testcase_28 AC 1,070 ms
324,972 KB
testcase_29 AC 311 ms
97,840 KB
testcase_30 AC 766 ms
165,632 KB
testcase_31 AC 1,081 ms
165,444 KB
testcase_32 AC 1,102 ms
163,472 KB
testcase_33 AC 1,542 ms
442,416 KB
testcase_34 AC 1,496 ms
443,172 KB
testcase_35 AC 1,533 ms
305,704 KB
testcase_36 AC 1,510 ms
305,444 KB
testcase_37 AC 793 ms
157,468 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
from collections import deque, Counter
sys.setrecursionlimit(5 * 10 ** 5)
from pypyjit import set_param
set_param('max_unroll_recursion=-1')
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

def solve(n, AB):
    dp = [[0] * 2 for _ in range(n)]
    s = set()
    graph = [[] for _ in range(n)]
    for a, b in AB:
        graph[a - 1].append(b - 1)
        graph[b - 1].append(a - 1)
    s.add(0)
    def dfs(now):
        dp[now][0] = dp[now][1] = 1
        des = []
        for to in graph[now]:
            if to not in s:
                des.append(to)
                s.add(to)
                dfs(to)

        for to in des:
            dp[now][0] *= (dp[to][0] + dp[to][1])
            dp[now][0] %= mod

        P = dp[now][0]
        dp[now][1] = P
        for to in des:
            P *= pow(dp[to][0] + dp[to][1], mod - 2, mod)
            P %= mod
            P *= dp[to][1]
            P %= mod
            dp[now][1] += P
            dp[now][1] %= mod
            P *= pow(dp[to][1], mod - 2, mod)
            P %= mod
            P *= (dp[to][0] + dp[to][1])
            P %= mod
    dfs(0)
    return dp[0][1]
        
class dsu():
    n=1
    parent_or_size=[-1 for i in range(n)]
    def __init__(self,N):
        self.n=N
        self.num = 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
        self.num -= 1
        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 count(self):
        return self.num


def solve_gu(n, AB):
    ans = 0
    for bit in range(1 << (n - 1)):
        U = dsu(n)
        for i in range(n - 1):
            if 1 & (bit >> i):
                a, b = AB[i]
                U.merge(a - 1, b - 1)
        cnt = 1
        for v in U.groups():
            cnt *= len(v)
            cnt %= mod
        ans += cnt
        ans %= mod
    return ans


n = ii()

AB = [li() for _ in range(n - 1)]

if n < 21:
    print(solve_gu(n, AB))
else:
    print(solve(n, AB))
0