#918669 (PyPy3) No.2497 GCD of LCMs

• 問題: No.2497 GCD of LCMs
• ユーザー: rlangevin
• 提出日時: 2023-10-06 22:48:20
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 720 ms / 2,000 ms
• コード長: 1,908 bytes
• コンパイル時間: 345 ms
• コンパイル使用メモリ: 82,444 KB
• 実行使用メモリ: 101,860 KB
• 最終ジャッジ日時: 2024-07-26 16:47:06
• 合計ジャッジ時間: 5,646 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 14

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
import sys
input = sys.stdin.readline
from heapq import heappush, heappop
inf = float('inf')
def dijkstra(s, g, N, val):
    # ゴールがない場合はg=-1とする。
    def cost(v, m):
        return v * N + m
    dist = [inf] * N
    mindist = [inf] * N
    seen = [False] * N
    Q = [cost(val, s)]
    while Q:
        c, m = divmod(heappop(Q), N)
        if seen[m]:
            continue
        seen[m] = True
        dist[m] = c
        if m == g:
            return dist
        #------heapをアップデートする。--------
        for u, C in G[m]:
            if seen[u]:
                continue
            newdist = max(dist[m], C)
            #------------------------------------
            if newdist >= mindist[u]:
                continue
            mindist[u] = newdist
            heappush(Q, cost(newdist, u))
    return dist
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])
    return arr
N, M = map(int, input().split())
A = list(map(int, input().split()))
Edge = []
for i in range(M):
    u, v = map(int, input().split())
    u, v = u - 1, v - 1
    Edge.append((u, v))
from collections import *
D = [defaultdict(int) for _ in range(N)]
ma = defaultdict(int)
for i in range(N):
    for k, v in factorization(A[i]):
        ma[k] = max(ma[k], v)
        D[i][k] = v    
ans = 1
mod = 998244353
ans = [1] * N
for k, v in ma.items():
    G = [[] for i in range(N)]
    for a, b in Edge:
        G[a].append((b, D[b][k]))
        G[b].append((a, D[a][k]))
        
    DD = dijkstra(0, -1, N, D[0][k])
    for i in range(N):
        ans[i] *= pow(k, DD[i], mod)
        ans[i] %= mod
        
for a in ans:
    print(a)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX