結果

問題 No.1917 LCMST
ユーザー 37zigen37zigen
提出日時 2022-04-30 01:27:33
言語 Java21
(openjdk 21)
結果
AC  
実行時間 3,936 ms / 4,000 ms
コード長 5,098 bytes
コンパイル時間 2,668 ms
コンパイル使用メモリ 81,388 KB
実行使用メモリ 137,696 KB
最終ジャッジ日時 2023-08-02 23:07:55
合計ジャッジ時間 106,280 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 280 ms
64,076 KB
testcase_01 AC 281 ms
64,592 KB
testcase_02 AC 287 ms
62,384 KB
testcase_03 AC 448 ms
68,168 KB
testcase_04 AC 478 ms
68,068 KB
testcase_05 AC 473 ms
68,160 KB
testcase_06 AC 447 ms
68,260 KB
testcase_07 AC 439 ms
68,508 KB
testcase_08 AC 288 ms
64,512 KB
testcase_09 AC 3,874 ms
130,852 KB
testcase_10 AC 3,850 ms
134,368 KB
testcase_11 AC 3,936 ms
137,696 KB
testcase_12 AC 3,744 ms
123,804 KB
testcase_13 AC 2,432 ms
94,580 KB
testcase_14 AC 3,801 ms
128,932 KB
testcase_15 AC 1,637 ms
87,444 KB
testcase_16 AC 2,508 ms
95,816 KB
testcase_17 AC 2,873 ms
106,356 KB
testcase_18 AC 3,047 ms
113,184 KB
testcase_19 AC 1,767 ms
86,840 KB
testcase_20 AC 1,337 ms
86,436 KB
testcase_21 AC 1,832 ms
88,328 KB
testcase_22 AC 1,478 ms
86,712 KB
testcase_23 AC 1,297 ms
85,796 KB
testcase_24 AC 1,919 ms
85,284 KB
testcase_25 AC 1,288 ms
86,388 KB
testcase_26 AC 1,567 ms
86,612 KB
testcase_27 AC 1,512 ms
86,452 KB
testcase_28 AC 1,594 ms
87,548 KB
testcase_29 AC 3,243 ms
133,432 KB
testcase_30 AC 3,317 ms
129,024 KB
testcase_31 AC 3,166 ms
133,268 KB
testcase_32 AC 3,521 ms
132,468 KB
testcase_33 AC 3,119 ms
132,080 KB
testcase_34 AC 430 ms
77,504 KB
testcase_35 AC 464 ms
77,596 KB
testcase_36 AC 449 ms
77,020 KB
testcase_37 AC 3,931 ms
136,588 KB
testcase_38 AC 3,824 ms
134,604 KB
testcase_39 AC 3,605 ms
128,916 KB
testcase_40 AC 3,881 ms
133,456 KB
testcase_41 AC 3,751 ms
133,580 KB
testcase_42 AC 3,816 ms
133,240 KB
testcase_43 AC 807 ms
80,036 KB
testcase_44 AC 728 ms
79,936 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main implements Runnable { //Runnableを実装する
    public static void main(String[] args) {
//        new Thread(null, new Main(), "", 16 * 1024 * 1024).start(); //16MBスタックを確保して実行
    	new Main().run();
    }
    
    long gcd(long a, long b) {
    	return a==0?b:gcd(b%a, a);
    }
    
    class DSU {
    	int[] parent;
    	public DSU(int n) {
    		parent=new int[n];
    		Arrays.fill(parent, -1);
    	}
    	int root(int x) {
    		return parent[x] < 0 ? x : (parent[x]=root(parent[x]));
    	}
    	boolean equiv(int x, int y) {
    		return root(x)==root(y);
    	}
    	void union(int x, int y) {
    		x=root(x);y=root(y);
    		if (x==y) return;
    		if (parent[x] < parent[y]) {
    			x^=y;y^=x;x^=y;
    		}
    		parent[y]+=parent[x];
    		parent[x]=y;
    	}
    }
    
    final int AMAX=100000;
    
    public void run() {
    	long ans = 0;
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		long[] A=new long[N];
		ArrayList<Integer>[] list=new ArrayList[AMAX+1];
		ArrayList<Integer>[] rev=new ArrayList[AMAX+1];
		for (int i=0;i<=AMAX;++i) list[i]=new ArrayList<>();
		for (int i=0;i<=AMAX;++i) rev[i]=new ArrayList<>();
		for (int i=0;i<N;++i) A[i]=sc.nextInt();
		Arrays.sort(A);
		for (int i = 0; i < N; ++i) {
			int j = i;
			while (j + 1 < N && A[i] == A[j + 1]) ++j;
			ans += A[i] * (j - i);
			i = j;
		}
		A = Arrays.stream(A).distinct().toArray();
		N = A.length;
		for (int i=0;i<N;++i) rev[(int)A[i]].add(i);
		for (int div = 1; div <= AMAX; ++div) {
			for (int v = 1; v * div <= AMAX; ++v) {
				for (int id : rev[v * div]) list[div].add(id);
			}
		}
		DSU dsu = new DSU(N);
		for (int t = 0; t < 30; ++t) {
			long[][] e=new long[N][3];
			for (int i=0;i<N;++i) {
				e[i][0]=i;
				e[i][1]=e[i][2]=-1;
			}
			for (int gcd=1;gcd<=AMAX;++gcd) {
				int dst=-1;
				for (int i : list[gcd]) {
					if (dst == -1 || A[i] < A[dst]) dst=i;
				}
				for (int i : list[gcd]) {
					if (dsu.equiv(i, dst)) continue;
					int src = dsu.root(i);
					if (e[src][1] == -1 || e[src][2] > A[i] * A[dst] / gcd) {
						e[src][1] = dst;
						e[src][2] = A[i] * A[dst] / gcd;
					}
				}
				if (dst == -1) continue;
				int dst_root=dsu.root(dst);
				for (int i : list[gcd]) {
					if (dsu.equiv(i, dst)) continue;
					if (e[dst_root][1] == -1 || e[dst_root][2] > A[i] * A[dst] / gcd) {
						e[dst_root][1] = i;
						e[dst_root][2] = A[i] * A[dst] / gcd;
					}
				}
				
			}
			Arrays.sort(e, (x, y) -> Long.compare(x[2], y[2]));
			for (int i = 0; i < N; ++i) {
				int src = (int) e[i][0];
				int dst = (int) e[i][1];
				long cost = e[i][2];
				if (dst == -1) continue;
				if (dsu.equiv(src, dst)) continue;
				ans += cost;
				dsu.union(src, dst);
			}
		}
		System.out.println(ans);
    }
	
	void tr(Object ... o) {System.out.println(Arrays.deepToString(o));}
}


class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}
0