結果

問題 No.1917 LCMST
ユーザー mkawa2mkawa2
提出日時 2023-11-14 14:28:57
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 3,163 ms / 4,000 ms
コード長 3,240 bytes
コンパイル時間 360 ms
コンパイル使用メモリ 81,828 KB
実行使用メモリ 292,476 KB
最終ジャッジ日時 2023-11-14 14:29:50
合計ジャッジ時間 51,886 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
64,836 KB
testcase_01 AC 48 ms
64,836 KB
testcase_02 AC 50 ms
64,836 KB
testcase_03 AC 106 ms
78,036 KB
testcase_04 AC 118 ms
78,096 KB
testcase_05 AC 108 ms
78,032 KB
testcase_06 AC 102 ms
78,024 KB
testcase_07 AC 105 ms
78,020 KB
testcase_08 AC 48 ms
64,836 KB
testcase_09 AC 3,163 ms
287,992 KB
testcase_10 AC 2,946 ms
287,800 KB
testcase_11 AC 3,008 ms
289,648 KB
testcase_12 AC 2,831 ms
292,476 KB
testcase_13 AC 1,078 ms
244,480 KB
testcase_14 AC 3,036 ms
290,216 KB
testcase_15 AC 700 ms
242,052 KB
testcase_16 AC 1,149 ms
244,604 KB
testcase_17 AC 1,651 ms
248,832 KB
testcase_18 AC 2,308 ms
269,164 KB
testcase_19 AC 677 ms
241,788 KB
testcase_20 AC 502 ms
240,636 KB
testcase_21 AC 739 ms
242,292 KB
testcase_22 AC 522 ms
240,388 KB
testcase_23 AC 534 ms
240,764 KB
testcase_24 AC 669 ms
242,048 KB
testcase_25 AC 529 ms
240,508 KB
testcase_26 AC 566 ms
241,020 KB
testcase_27 AC 625 ms
241,276 KB
testcase_28 AC 613 ms
241,640 KB
testcase_29 AC 1,114 ms
286,324 KB
testcase_30 AC 1,161 ms
286,324 KB
testcase_31 AC 1,169 ms
286,324 KB
testcase_32 AC 1,151 ms
286,472 KB
testcase_33 AC 1,138 ms
286,468 KB
testcase_34 AC 222 ms
222,204 KB
testcase_35 AC 221 ms
222,196 KB
testcase_36 AC 239 ms
222,212 KB
testcase_37 AC 1,446 ms
286,328 KB
testcase_38 AC 1,560 ms
286,260 KB
testcase_39 AC 1,594 ms
287,060 KB
testcase_40 AC 1,654 ms
286,712 KB
testcase_41 AC 1,626 ms
286,880 KB
testcase_42 AC 2,002 ms
286,948 KB
testcase_43 AC 290 ms
240,132 KB
testcase_44 AC 291 ms
240,252 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(1000005)
# 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 << 63)
# 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):
        pp, ee = [], []
        while x > 1:
            mpf = self.min_prime_factor[x]
            if pp and mpf == pp[-1]:
                ee[-1] += 1
            else:
                pp.append(mpf)
                ee.append(1)
            x //= mpf
        return pp, ee

    # 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

class UnionFind:
    def __init__(self, n):
        self._tree = [-1]*n
        # number of connected component
        self.cnt = n

    def root(self, u):
        stack = []
        while self._tree[u] >= 0:
            stack.append(u)
            u = self._tree[u]
        for v in stack: self._tree[v] = u
        return u

    def same(self, u, v):
        return self.root(u) == self.root(v)

    def merge(self, u, v):
        u, v = self.root(u), self.root(v)
        if u == v: return False
        if self._tree[u] > self._tree[v]: u, v = v, u
        self._tree[u] += self._tree[v]
        self._tree[v] = u
        self.cnt -= 1
        return True

    # size of connected component
    def size(self, u):
        return -self._tree[self.root(u)]

from collections import defaultdict

sv=Sieve(100000)

n=II()
aa=set()
ans=0
for a in LI():
    if a in aa:
        ans+=a
    else:
        aa.add(a)

g2a=defaultdict(lambda :200000)
aa=sorted(aa)
a2i={}
lab=[]
for i,a in enumerate(aa):
    a2i[a]=i
    ff=sv.factor(a)
    for f in ff:
        if f in g2a:
            b=g2a[f]
            l=a*b//f
            lab.append((l,a,b))
        g2a[f]=min(g2a[f],a)

lab.sort(key=lambda x:x[0])
uf=UnionFind(len(aa))
for l,a,b in lab:
    i=a2i[a]
    j=a2i[b]
    if uf.merge(i,j):ans+=l

print(ans)
0