結果
問題 | No.1917 LCMST |
ユーザー | 37zigen |
提出日時 | 2022-05-01 22:10:47 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 3,599 ms / 4,000 ms |
コード長 | 5,043 bytes |
コンパイル時間 | 3,140 ms |
コンパイル使用メモリ | 80,428 KB |
実行使用メモリ | 133,056 KB |
最終ジャッジ日時 | 2023-09-13 14:58:23 |
合計ジャッジ時間 | 97,340 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 275 ms
50,672 KB |
testcase_01 | AC | 276 ms
50,676 KB |
testcase_02 | AC | 270 ms
50,844 KB |
testcase_03 | AC | 494 ms
52,580 KB |
testcase_04 | AC | 454 ms
53,056 KB |
testcase_05 | AC | 478 ms
53,316 KB |
testcase_06 | AC | 474 ms
53,240 KB |
testcase_07 | AC | 425 ms
53,152 KB |
testcase_08 | AC | 276 ms
50,636 KB |
testcase_09 | AC | 3,599 ms
123,912 KB |
testcase_10 | AC | 3,578 ms
123,296 KB |
testcase_11 | AC | 3,523 ms
117,408 KB |
testcase_12 | AC | 3,172 ms
111,628 KB |
testcase_13 | AC | 1,952 ms
80,592 KB |
testcase_14 | AC | 3,470 ms
122,280 KB |
testcase_15 | AC | 1,770 ms
75,704 KB |
testcase_16 | AC | 1,895 ms
82,340 KB |
testcase_17 | AC | 2,343 ms
95,336 KB |
testcase_18 | AC | 2,579 ms
107,912 KB |
testcase_19 | AC | 1,581 ms
87,136 KB |
testcase_20 | AC | 1,392 ms
86,696 KB |
testcase_21 | AC | 1,564 ms
86,272 KB |
testcase_22 | AC | 1,389 ms
76,924 KB |
testcase_23 | AC | 1,184 ms
76,580 KB |
testcase_24 | AC | 1,600 ms
77,116 KB |
testcase_25 | AC | 1,375 ms
76,416 KB |
testcase_26 | AC | 1,400 ms
77,408 KB |
testcase_27 | AC | 1,371 ms
76,908 KB |
testcase_28 | AC | 1,528 ms
77,692 KB |
testcase_29 | AC | 3,079 ms
122,512 KB |
testcase_30 | AC | 3,093 ms
131,560 KB |
testcase_31 | AC | 3,221 ms
132,132 KB |
testcase_32 | AC | 3,222 ms
124,596 KB |
testcase_33 | AC | 3,150 ms
119,460 KB |
testcase_34 | AC | 418 ms
76,548 KB |
testcase_35 | AC | 431 ms
77,616 KB |
testcase_36 | AC | 405 ms
74,632 KB |
testcase_37 | AC | 3,085 ms
133,056 KB |
testcase_38 | AC | 3,096 ms
120,512 KB |
testcase_39 | AC | 3,307 ms
119,820 KB |
testcase_40 | AC | 3,276 ms
124,936 KB |
testcase_41 | AC | 3,010 ms
119,376 KB |
testcase_42 | AC | 3,382 ms
131,028 KB |
testcase_43 | AC | 782 ms
80,076 KB |
testcase_44 | AC | 638 ms
78,168 KB |
ソースコード
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; } } } 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());} }