結果
問題 | No.14 最小公倍数ソート |
ユーザー | 37zigen |
提出日時 | 2020-03-18 02:16:04 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 530 ms / 5,000 ms |
コード長 | 4,245 bytes |
コンパイル時間 | 2,416 ms |
コンパイル使用メモリ | 83,840 KB |
実行使用メモリ | 50,448 KB |
最終ジャッジ日時 | 2023-08-20 19:33:00 |
合計ジャッジ時間 | 12,266 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 142 ms
41,908 KB |
testcase_01 | AC | 130 ms
42,168 KB |
testcase_02 | AC | 133 ms
41,808 KB |
testcase_03 | AC | 254 ms
45,008 KB |
testcase_04 | AC | 459 ms
50,148 KB |
testcase_05 | AC | 400 ms
49,708 KB |
testcase_06 | AC | 386 ms
49,416 KB |
testcase_07 | AC | 431 ms
49,100 KB |
testcase_08 | AC | 438 ms
50,048 KB |
testcase_09 | AC | 458 ms
50,040 KB |
testcase_10 | AC | 448 ms
50,276 KB |
testcase_11 | AC | 464 ms
50,024 KB |
testcase_12 | AC | 530 ms
49,972 KB |
testcase_13 | AC | 491 ms
49,908 KB |
testcase_14 | AC | 502 ms
50,448 KB |
testcase_15 | AC | 511 ms
49,544 KB |
testcase_16 | AC | 417 ms
49,072 KB |
testcase_17 | AC | 394 ms
50,108 KB |
testcase_18 | AC | 348 ms
47,340 KB |
testcase_19 | AC | 456 ms
49,672 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.ArrayDeque; import java.util.Arrays; import java.util.NoSuchElementException; import java.util.Scanner; class Main { public static void main(String[] args) { new Main().run(); } class P implements Comparable<P>{ int val; int sz; int div; int gcd; public P(int val,int sz,int div) { this.val=val; this.sz=sz; this.div=div; this.gcd=val/div; } @Override public int compareTo(P o) { if(this.gcd!=o.gcd) { return Integer.compare(this.gcd, o.gcd); }else { return Integer.compare(this.val, o.val); } } } void run() { Scanner sc=new Scanner(System.in); ArrayDeque<P>[] min=new ArrayDeque[10001]; int[] cnt=new int[10001]; for(int i=0;i<min.length;++i)min[i]=new ArrayDeque<>(); int n=sc.nextInt(); int[] a=new int[n]; int[] b=new int[n-1]; for(int i=0;i<n;++i) { a[i]=sc.nextInt(); cnt[a[i]]++; } for(int i=1;i<n;++i)b[i-1]=a[i]; Arrays.sort(b); cnt[a[0]]--; for(int i=0;i<b.length;++i) { for(int div=1;div*div<=b[i];++div) { if(b[i]%div!=0)continue; if(!min[div].isEmpty()&&min[div].peekLast().val==b[i])min[div].peekLast().sz++; else min[div].add(new P(b[i],1,div)); if(div==b[i]/div)continue; if(!min[b[i]/div].isEmpty()&&min[b[i]/div].peekLast().val==b[i])min[b[i]/div].peekLast().sz++; else min[b[i]/div].add(new P(b[i],1,b[i]/div)); } } int cur=a[0]; for(int i=0;i<n;++i) { System.out.print(cur+(i==n-1?"\n":" ")); P next=new P(Integer.MAX_VALUE/3,0,1); for(int div=1;div*div<=cur;++div) { if(cur%div!=0)continue; for(int d:new int[] {div,cur/div}) { while(!min[d].isEmpty()&&min[d].peekFirst().sz>cnt[min[d].peekFirst().val]) { min[d].peekFirst().sz=cnt[min[d].peekFirst().val]; if(min[d].peekFirst().sz==0)min[d].pollFirst(); } if(!min[d].isEmpty()&&next.compareTo(min[d].peekFirst())==1) { next=min[d].peekFirst(); } } } if(next.val>=cnt.length)continue; cur=next.val; cnt[next.val]--; } } void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));} } 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());} }