結果
問題 | No.1917 LCMST |
ユーザー | tenten |
提出日時 | 2023-06-29 15:59:57 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 2,881 ms / 4,000 ms |
コード長 | 4,506 bytes |
コンパイル時間 | 4,234 ms |
コンパイル使用メモリ | 94,044 KB |
実行使用メモリ | 177,016 KB |
最終ジャッジ日時 | 2023-09-20 11:19:32 |
合計ジャッジ時間 | 72,454 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,808 KB |
testcase_01 | AC | 43 ms
49,704 KB |
testcase_02 | AC | 43 ms
49,900 KB |
testcase_03 | AC | 139 ms
56,772 KB |
testcase_04 | AC | 150 ms
54,904 KB |
testcase_05 | AC | 146 ms
56,640 KB |
testcase_06 | AC | 150 ms
56,748 KB |
testcase_07 | AC | 141 ms
57,128 KB |
testcase_08 | AC | 43 ms
49,776 KB |
testcase_09 | AC | 2,546 ms
176,132 KB |
testcase_10 | AC | 2,836 ms
174,944 KB |
testcase_11 | AC | 2,711 ms
175,884 KB |
testcase_12 | AC | 2,251 ms
159,280 KB |
testcase_13 | AC | 1,812 ms
108,636 KB |
testcase_14 | AC | 2,881 ms
172,624 KB |
testcase_15 | AC | 1,430 ms
91,288 KB |
testcase_16 | AC | 1,871 ms
114,348 KB |
testcase_17 | AC | 2,383 ms
140,760 KB |
testcase_18 | AC | 2,190 ms
148,604 KB |
testcase_19 | AC | 1,392 ms
91,204 KB |
testcase_20 | AC | 1,012 ms
90,296 KB |
testcase_21 | AC | 1,310 ms
91,976 KB |
testcase_22 | AC | 1,075 ms
91,804 KB |
testcase_23 | AC | 1,098 ms
90,480 KB |
testcase_24 | AC | 1,318 ms
89,908 KB |
testcase_25 | AC | 1,076 ms
91,184 KB |
testcase_26 | AC | 1,147 ms
91,900 KB |
testcase_27 | AC | 1,248 ms
91,340 KB |
testcase_28 | AC | 1,291 ms
91,512 KB |
testcase_29 | AC | 2,489 ms
166,012 KB |
testcase_30 | AC | 2,433 ms
177,016 KB |
testcase_31 | AC | 2,339 ms
176,164 KB |
testcase_32 | AC | 2,661 ms
176,148 KB |
testcase_33 | AC | 2,469 ms
175,144 KB |
testcase_34 | AC | 375 ms
80,988 KB |
testcase_35 | AC | 373 ms
81,356 KB |
testcase_36 | AC | 372 ms
81,132 KB |
testcase_37 | AC | 2,536 ms
175,380 KB |
testcase_38 | AC | 2,759 ms
175,536 KB |
testcase_39 | AC | 2,421 ms
175,568 KB |
testcase_40 | AC | 2,809 ms
176,308 KB |
testcase_41 | AC | 2,429 ms
175,832 KB |
testcase_42 | AC | 2,576 ms
175,552 KB |
testcase_43 | AC | 569 ms
84,152 KB |
testcase_44 | AC | 539 ms
82,552 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int[] values = new int[n]; for (int i = 0; i < n; i++) { values[i] = sc.nextInt(); } Arrays.sort(values); HashMap<Integer, ArrayList<Integer>> idxes = new HashMap<>(); long ans = 0; for (int i = 0; i < n; i++) { if (i > 0 && values[i] == values[i - 1]) { ans += values[i]; continue; } for (int j = 1; j <= Math.sqrt(values[i]); j++) { if (values[i] % j == 0) { if (!idxes.containsKey(j)) { idxes.put(j, new ArrayList<>()); } idxes.get(j).add(i); if (j * j < values[i]) { if (!idxes.containsKey(values[i] / j)) { idxes.put(values[i] / j, new ArrayList<>()); } idxes.get(values[i] / j).add(i); } } } } PriorityQueue<Bridge> queue = new PriorityQueue<>(); for (int x : idxes.keySet()) { long base = values[idxes.get(x).get(0)] / x; for (int i = 1; i < idxes.get(x).size(); i++) { queue.add(new Bridge(idxes.get(x).get(0), idxes.get(x).get(i), base * values[idxes.get(x).get(i)])); } } UnionFindTree uft = new UnionFindTree(n); while (queue.size() > 0) { Bridge b = queue.poll(); if (!uft.same(b)) { uft.unite(b); ans += b.value; } } System.out.println(ans); } static class Bridge implements Comparable<Bridge> { int left; int right; long value; public Bridge(int left, int right, long value) { this.left = left; this.right = right; this.value = value; } public int compareTo(Bridge another) { if (value == another.value) { return 0; } else if (value < another.value) { return -1; } else { return 1; } } } static class UnionFindTree { int[] parents; public UnionFindTree(int size) { parents = new int[size]; for (int i = 0; i < size; i++) { parents[i] = i; } } public int find(int x) { if (x == parents[x]) { return x; } else { return parents[x] = find(parents[x]); } } public boolean same(int x, int y) { return find(x) == find(y); } public boolean same(Bridge x) { return same(x.left, x.right); } public void unite(int x, int y) { parents[find(x)] = find(y); } public void unite(Bridge b) { unite(b.left, b.right); } } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }