提出 #61433470

---

ソースコード 拡げる

import sys
sys.setrecursionlimit(2*10**5)
N,M = map(int, input().split())
edge = [[] for i in range(N)]

for i in range(N-1):
    a,b = map(int, input().split())
    a-=1;b-=1
    edge[a].append(b)
    edge[b].append(a)

dp0 = [1] * N

def dfs(now,par):
    res = 1
    for _next in edge[now]:
        if _next == par:
            continue
        dfs(_next,now)
        res *= (dp0[_next]+1) % M
        res %= M

    dp0[now] = res

dfs(0,-1)
ans_l = [1] * N
#exit()
def dfs2(now,par,val):
    l = []
    ans = 1
    for _next in edge[now]:
        if _next == par:
            l.append((val+1)%M)
            ans *= val+1
            ans %= M
        else:
            l.append((dp0[_next]+1)%M)
    accu_l,accu_r = [1],[1]

    for node in l:
        accu_l.append(accu_l[-1]*node%M)
    for node in l[::-1]:
        accu_r.append(accu_r[-1]*node%M)
    ans_l[now] = accu_l[-1]

    for id,_next in enumerate(edge[now]):
        if _next == par:
            continue
        else:
            dfs2(_next,now,accu_l[id]*accu_r[-(id+2)]%M)
dfs2(0,-1,1)
for i in ans_l:
    print(i)







dfs2(0,-1,1)

提出情報

ジャッジ結果