#981462 (PyPy3) No.2756 GCD Teleporter

• 問題: No.2756 GCD Teleporter
• ユーザー: titia
• 提出日時: 2024-05-14 04:21:52
• 言語: PyPy3 (7.3.15)
• 結果: RE
• 実行時間: -
• コード長: 1,860 bytes
• コンパイル時間: 415 ms
• コンパイル使用メモリ: 82,344 KB
• 実行使用メモリ: 138,176 KB
• 最終ジャッジ日時: 2024-12-20 09:49:21
• 合計ジャッジ時間: 16,065 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
sample	AC * 4
other	AC * 35 RE * 1

ソースコード

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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
import sys
input = sys.stdin.readline
N=int(input())
A=list(map(int,input().split()))
mod=998244353
# エラトステネスの篩を用いた素因数分解・約数列挙
MAX=5*10**5+10 # 使いたい最大値を指定
# Sieve[i]で、iの最も小さい約数を返す。
Sieve=[i for i in range(MAX)]
for i in range(2,MAX):
    if Sieve[i]!=i:
        continue
    
    for j in range(i,MAX,i):
        if Sieve[j]==j:
            Sieve[j]=i
# 素因数分解
def fact(x):
    D=dict()
    while x!=1:
        k=Sieve[x]
        if k in D:
            D[k]+=1
        else:
            D[k]=1
        x//=k
    return D
# 約数列挙
def faclist(x):
    LIST=[1]
    while x!=1:
        k=Sieve[x]
        count=0
        while x%k==0:
            count+=1
            x//=k
        LIST2=[]
        for l in LIST:
            for i in range(1,count+1):
                LIST2.append(l*k**i)
        LIST+=LIST2
    return LIST
LIST=[]
for a in A:
    LIST+=fact(a)
LIST=sorted(set(LIST))
D={LIST[i]:i for i in range(len(LIST))}
E=[[] for i in range(N+len(LIST))]
n=N+len(LIST)
# UnionFind
Group = [i for i in range(n)] # グループ分け
Nodes = [1]*(n) # 各グループのノードの数
def find(x):
    while Group[x] != x:
        x=Group[x]
    return x
def Union(x,y):
    if find(x) != find(y):
        if Nodes[find(x)] < Nodes[find(y)]:
            
            Nodes[find(y)] += Nodes[find(x)]
            Nodes[find(x)] = 0
            Group[find(x)] = find(y)
            
        else:
            Nodes[find(x)] += Nodes[find(y)]
            Nodes[find(y)] = 0
            Group[find(y)] = find(x)
for i in range(N):
    a=A[i]
    for u in fact(a):
        Union(i,D[u]+N)
#print([find(i) for i in range(n)])
k=LIST[0]
c=0
for i in range(n):
    if find(i)==i:
        c+=1
ANS=k*(c-1)
ANS2=2*c
print(min(ANS,ANS2))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX