結果

問題 No.1917 LCMST
ユーザー tentententen
提出日時 2023-02-07 09:10:54
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,610 ms / 4,000 ms
コード長 5,061 bytes
コンパイル時間 4,090 ms
コンパイル使用メモリ 98,732 KB
実行使用メモリ 180,892 KB
最終ジャッジ日時 2023-09-18 17:22:10
合計ジャッジ時間 69,868 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
49,576 KB
testcase_01 AC 47 ms
49,844 KB
testcase_02 AC 47 ms
49,856 KB
testcase_03 AC 149 ms
56,248 KB
testcase_04 AC 133 ms
56,556 KB
testcase_05 AC 152 ms
56,428 KB
testcase_06 AC 144 ms
56,676 KB
testcase_07 AC 154 ms
56,760 KB
testcase_08 AC 47 ms
49,808 KB
testcase_09 AC 2,441 ms
179,272 KB
testcase_10 AC 2,610 ms
180,524 KB
testcase_11 AC 2,377 ms
180,500 KB
testcase_12 AC 2,474 ms
167,788 KB
testcase_13 AC 1,623 ms
114,012 KB
testcase_14 AC 2,438 ms
174,668 KB
testcase_15 AC 1,255 ms
88,784 KB
testcase_16 AC 1,617 ms
111,416 KB
testcase_17 AC 2,102 ms
122,888 KB
testcase_18 AC 2,186 ms
145,052 KB
testcase_19 AC 1,280 ms
90,144 KB
testcase_20 AC 972 ms
87,400 KB
testcase_21 AC 1,147 ms
87,492 KB
testcase_22 AC 981 ms
88,928 KB
testcase_23 AC 1,089 ms
89,148 KB
testcase_24 AC 1,270 ms
88,072 KB
testcase_25 AC 1,044 ms
88,156 KB
testcase_26 AC 1,069 ms
88,860 KB
testcase_27 AC 1,112 ms
89,588 KB
testcase_28 AC 1,330 ms
87,636 KB
testcase_29 AC 2,345 ms
180,892 KB
testcase_30 AC 2,380 ms
178,792 KB
testcase_31 AC 2,274 ms
180,320 KB
testcase_32 AC 2,417 ms
180,060 KB
testcase_33 AC 2,341 ms
179,916 KB
testcase_34 AC 380 ms
80,416 KB
testcase_35 AC 379 ms
80,692 KB
testcase_36 AC 382 ms
80,968 KB
testcase_37 AC 2,432 ms
175,620 KB
testcase_38 AC 2,439 ms
174,204 KB
testcase_39 AC 2,277 ms
175,180 KB
testcase_40 AC 2,476 ms
179,960 KB
testcase_41 AC 2,303 ms
179,932 KB
testcase_42 AC 2,440 ms
175,856 KB
testcase_43 AC 540 ms
82,776 KB
testcase_44 AC 569 ms
83,000 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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);
        long ans = 0;
        for (int i = 0; i < n - 1; i++) {
            if (values[i] == values[i + 1]) {
                ans += values[i];
                values[i] = 0;
            }
        }
        HashMap<Integer, ArrayList<Unit>> result = new HashMap<>();
        for (int i = 0; i < n; i++) {
            int x = values[i];
            if (x == 0) {
                continue;
            }
            for (int j = 1; j <= Math.sqrt(x); j++) {
                if (x % j > 0) {
                    continue;
                }
                if (!result.containsKey(j)) {
                    result.put(j, new ArrayList<>());
                }
                result.get(j).add(new Unit(i, x / j));
                if (j * j == x) {
                    continue;
                }
                if (!result.containsKey(x / j)) {
                    result.put(x / j, new ArrayList<>());
                }
                result.get(x / j).add(new Unit(i, j));
            }
        }
        ArrayList<Bridge> bridges = new ArrayList<>();
        for (int x : result.keySet()) {
            ArrayList<Unit> list = result.get(x);
            Unit base = list.get(0);
            list.remove(0);
            for (Unit y : list) {
                bridges.add(new Bridge(base.idx, y.idx, (long)base.value * y.value * x));
            }
        }
        Collections.sort(bridges);
        UnionFindTree uft = new UnionFindTree(n);
        for (Bridge x : bridges) {
            if (!uft.same(x)) {
                uft.unite(x);
                ans += x.value;
            }
        }
        System.out.println(ans);
    }
    
    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(y)] = find(x);
        }
        
        public void unite(Bridge x) {
            unite(x.left, x.right);
        }
    }
    
    
    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 Unit implements Comparable<Unit> {
        int idx;
        int value;
        
        public Unit(int idx, int value) {
            this.idx = idx;
            this.value = value;
        }
        
        public int compareTo(Unit another) {
            return value - another.value;
        }
        
        public String toString() {
            return idx + ":" + value;
        }
    }
}
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();
    }
    
}
0