結果

問題 No.3250 最小公倍数
ユーザー mkawa2
提出日時 2025-08-29 22:40:38
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 2,648 bytes
コンパイル時間 693 ms
コンパイル使用メモリ 82,080 KB
実行使用メモリ 432,756 KB
最終ジャッジ日時 2025-08-29 22:41:06
合計ジャッジ時間 23,654 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 18 TLE * 1 -- * 2
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
# inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

class Sieve:
    def __init__(self, n):
        self.plist = [2]
        min_prime_factor = [2, 0]*(n//2+1)
        for x in range(3, n+1, 2):
            if min_prime_factor[x] == 0:
                min_prime_factor[x] = x
                self.plist.append(x)
                if x**2 > n: continue
                for y in range(x**2, n+1, 2*x):
                    if min_prime_factor[y] == 0:
                        min_prime_factor[y] = x
        self.min_prime_factor = min_prime_factor

    def isprime(self, x):
        return self.min_prime_factor[x] == x

    def pf(self, x):
        p2e=Counter()
        while x > 1:
            mpf = self.min_prime_factor[x]
            p2e[mpf]+=1
            x //= mpf
        return p2e

    # unsorted
    def factor(self, a):
        ff = [1]
        pp, ee = self.pf(a)
        for p, e in zip(pp, ee):
            ff, gg = [], ff
            w = p
            for _ in range(e):
                for f in gg: ff.append(f*w)
                w *= p
            ff += gg
        return ff

sv=Sieve(1000000)

from collections import Counter

n=II()
aa=LI()
to=[[] for _ in range(n)]
for _ in range(n-1):
    u,v=LI1()
    to[u].append(v)
    to[v].append(u)

def dfs(root=0):
    uu, stack = [], [root]
    while stack:
        u = stack.pop()
        uu.append(u)
        for v in to[u]:
            if v == parent[u]: continue
            parent[v] = u
            depth[v] = depth[u]+1
            stack.append(v)
    return uu

parent, depth = [-1]*n, [0]*n
uu = dfs()

ans=[0]*n
dp=[sv.pf(a) for a in aa]
for u in uu[::-1]:
    ans[u]=aa[u]
    if u==0:break
    v=parent[u]
    if len(dp[v])<len(dp[u]):
        dp[v],dp[u]=dp[u],dp[v]
        aa[v], aa[u] = aa[u], aa[v]
    for p, e in dp[u].items():
        if e>dp[v][p]:
            aa[v]=aa[v]*pow(p,e-dp[v][p],md)%md
            dp[v][p]=e

for a in ans:print(a)
0