結果
問題 | No.1917 LCMST |
ユーザー | 👑 rin204 |
提出日時 | 2022-05-05 14:23:01 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 3,887 ms / 4,000 ms |
コード長 | 1,948 bytes |
コンパイル時間 | 997 ms |
コンパイル使用メモリ | 87,028 KB |
実行使用メモリ | 312,380 KB |
最終ジャッジ日時 | 2023-09-17 22:03:19 |
合計ジャッジ時間 | 75,884 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 78 ms
71,316 KB |
testcase_01 | AC | 77 ms
71,056 KB |
testcase_02 | AC | 84 ms
76,268 KB |
testcase_03 | AC | 157 ms
79,352 KB |
testcase_04 | AC | 127 ms
78,956 KB |
testcase_05 | AC | 129 ms
78,696 KB |
testcase_06 | AC | 129 ms
78,976 KB |
testcase_07 | AC | 123 ms
78,880 KB |
testcase_08 | AC | 76 ms
71,320 KB |
testcase_09 | AC | 3,887 ms
306,336 KB |
testcase_10 | AC | 3,699 ms
312,380 KB |
testcase_11 | AC | 3,287 ms
310,444 KB |
testcase_12 | AC | 2,853 ms
283,752 KB |
testcase_13 | AC | 1,153 ms
253,536 KB |
testcase_14 | AC | 3,117 ms
292,660 KB |
testcase_15 | AC | 870 ms
250,836 KB |
testcase_16 | AC | 1,204 ms
251,796 KB |
testcase_17 | AC | 1,655 ms
253,008 KB |
testcase_18 | AC | 1,945 ms
254,128 KB |
testcase_19 | AC | 909 ms
252,008 KB |
testcase_20 | AC | 732 ms
252,168 KB |
testcase_21 | AC | 951 ms
253,076 KB |
testcase_22 | AC | 732 ms
250,120 KB |
testcase_23 | AC | 716 ms
250,716 KB |
testcase_24 | AC | 908 ms
252,424 KB |
testcase_25 | AC | 731 ms
251,900 KB |
testcase_26 | AC | 797 ms
251,224 KB |
testcase_27 | AC | 820 ms
252,188 KB |
testcase_28 | AC | 861 ms
249,100 KB |
testcase_29 | AC | 2,986 ms
300,280 KB |
testcase_30 | AC | 2,949 ms
300,740 KB |
testcase_31 | AC | 2,986 ms
300,300 KB |
testcase_32 | AC | 2,972 ms
300,328 KB |
testcase_33 | AC | 2,963 ms
300,512 KB |
testcase_34 | AC | 290 ms
234,908 KB |
testcase_35 | AC | 284 ms
234,728 KB |
testcase_36 | AC | 280 ms
234,820 KB |
testcase_37 | AC | 3,077 ms
309,896 KB |
testcase_38 | AC | 3,169 ms
310,064 KB |
testcase_39 | AC | 3,183 ms
309,880 KB |
testcase_40 | AC | 3,143 ms
310,364 KB |
testcase_41 | AC | 3,232 ms
310,452 KB |
testcase_42 | AC | 3,322 ms
310,088 KB |
testcase_43 | AC | 350 ms
249,888 KB |
testcase_44 | AC | 350 ms
249,660 KB |
ソースコード
from math import gcd class UnionFind: def __init__(self, n): self.n = n self.parents = [-1] * n self.group = n def find(self, x): if self.parents[x] < 0: return x else: self.parents[x] = self.find(self.parents[x]) return self.parents[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x == y: return self.group -= 1 if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x def size(self, x): return -self.parents[self.find(x)] def same(self, x, y): return self.find(x) == self.find(y) def members(self, x): root = self.find(x) return [i for i in range(self.n) if self.find(i) == root] def roots(self): return [i for i, x in enumerate(self.parents) if x < 0] def group_count(self): return self.group def all_group_members(self): dic = {r:[] for r in self.roots()} for i in range(self.n): dic[self.find(i)].append(i) return dic def __str__(self): return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots()) n = int(input()) A = list(map(int, input().split())) A.sort() ma = A[-1] B = [] bef = -1 ans = 0 ind = [-1] * (ma + 1) l = 0 for a in A: if a == bef: ans += a else: B.append(a) bef = a ind[a] = l l += 1 edges = [] for i in range(1, ma + 1): ii = -1 for j in range(i, ma + 1, i): if ind[j] != -1: if ii == -1: ii = ind[j] else: jj = ind[j] edges.append((B[ii] * B[jj] // gcd(B[ii], B[jj]), ii, jj)) edges.sort() UF = UnionFind(n) for c, i, j in edges: if not UF.same(i, j): ans += c UF.union(i, j) print(ans)