結果
問題 | No.1532 Different Products |
ユーザー | 37zigen |
提出日時 | 2021-06-04 23:06:50 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,709 ms / 4,000 ms |
コード長 | 3,340 bytes |
コンパイル時間 | 2,419 ms |
コンパイル使用メモリ | 79,076 KB |
実行使用メモリ | 369,624 KB |
最終ジャッジ日時 | 2024-11-20 06:31:35 |
合計ジャッジ時間 | 85,599 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 580 ms
369,568 KB |
testcase_01 | AC | 921 ms
369,524 KB |
testcase_02 | AC | 603 ms
369,320 KB |
testcase_03 | AC | 572 ms
369,420 KB |
testcase_04 | AC | 571 ms
369,408 KB |
testcase_05 | AC | 574 ms
369,560 KB |
testcase_06 | AC | 584 ms
369,460 KB |
testcase_07 | AC | 622 ms
369,468 KB |
testcase_08 | AC | 733 ms
369,424 KB |
testcase_09 | AC | 762 ms
369,608 KB |
testcase_10 | AC | 897 ms
369,396 KB |
testcase_11 | AC | 845 ms
369,596 KB |
testcase_12 | AC | 1,051 ms
369,452 KB |
testcase_13 | AC | 965 ms
369,396 KB |
testcase_14 | AC | 1,615 ms
369,420 KB |
testcase_15 | AC | 649 ms
369,540 KB |
testcase_16 | AC | 982 ms
369,548 KB |
testcase_17 | AC | 860 ms
369,352 KB |
testcase_18 | AC | 890 ms
369,524 KB |
testcase_19 | AC | 1,004 ms
369,408 KB |
testcase_20 | AC | 1,468 ms
369,536 KB |
testcase_21 | AC | 1,147 ms
369,312 KB |
testcase_22 | AC | 923 ms
369,424 KB |
testcase_23 | AC | 854 ms
369,428 KB |
testcase_24 | AC | 1,411 ms
369,472 KB |
testcase_25 | AC | 1,079 ms
369,436 KB |
testcase_26 | AC | 839 ms
369,568 KB |
testcase_27 | AC | 1,291 ms
369,600 KB |
testcase_28 | AC | 1,005 ms
369,448 KB |
testcase_29 | AC | 1,364 ms
369,480 KB |
testcase_30 | AC | 1,526 ms
369,516 KB |
testcase_31 | AC | 1,469 ms
369,496 KB |
testcase_32 | AC | 1,539 ms
369,452 KB |
testcase_33 | AC | 1,399 ms
369,460 KB |
testcase_34 | AC | 1,473 ms
369,488 KB |
testcase_35 | AC | 1,485 ms
369,316 KB |
testcase_36 | AC | 1,597 ms
369,396 KB |
testcase_37 | AC | 1,296 ms
369,440 KB |
testcase_38 | AC | 1,539 ms
369,432 KB |
testcase_39 | AC | 1,498 ms
369,548 KB |
testcase_40 | AC | 1,475 ms
369,552 KB |
testcase_41 | AC | 1,624 ms
369,536 KB |
testcase_42 | AC | 1,593 ms
369,528 KB |
testcase_43 | AC | 1,592 ms
369,596 KB |
testcase_44 | AC | 1,668 ms
369,544 KB |
testcase_45 | AC | 1,672 ms
369,520 KB |
testcase_46 | AC | 1,663 ms
369,428 KB |
testcase_47 | AC | 1,676 ms
369,428 KB |
testcase_48 | AC | 1,709 ms
369,600 KB |
testcase_49 | AC | 1,685 ms
369,528 KB |
testcase_50 | AC | 1,681 ms
369,572 KB |
testcase_51 | AC | 1,684 ms
369,440 KB |
testcase_52 | AC | 1,678 ms
369,552 KB |
testcase_53 | AC | 1,672 ms
369,440 KB |
testcase_54 | AC | 1,667 ms
369,528 KB |
testcase_55 | AC | 1,677 ms
369,440 KB |
testcase_56 | AC | 1,670 ms
369,412 KB |
testcase_57 | AC | 1,702 ms
369,300 KB |
testcase_58 | AC | 1,678 ms
369,624 KB |
testcase_59 | AC | 1,660 ms
369,436 KB |
testcase_60 | AC | 1,680 ms
369,416 KB |
testcase_61 | AC | 572 ms
369,440 KB |
testcase_62 | AC | 574 ms
369,476 KB |
testcase_63 | AC | 1,679 ms
369,512 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.math.BigInteger; import java.util.ArrayList; import java.util.Arrays; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) { new Main().run(); } long dfs(long[][] dp, long[] dp2, int num, int v, long prd, long K) { long ret=0; if (num==3) ret+=dp2[(int)(K/prd)]; if (num>=4) return dp[v][(int)(K/prd)]; for (int i=v;i>20;--i) { ret+=dfs(dp, dp2, num+1, i-1, prd*i, K); } return ret; } void run() { FastScanner sc = new FastScanner(); int N=sc.nextInt(); long K=sc.nextLong(); long ans=0; long[][] dp=new long[201][(int)1e5]; long[] dp2=new long[(int)1e6]; { dp[0][1]=1; for (int i=1;i<=200;++i) { dp[i]=Arrays.copyOf(dp[i-1], dp[i-1].length); for (int j=1;j<dp[i-1].length;++j) { if (j*i<dp[i].length) dp[i][j*i]+=dp[i-1][j]; } } for (int i=0;i<=200;++i) { for (int j=1;j<dp[i].length;++j) { dp[i][j]+=dp[i][j-1]; } } } int max=Math.min(N, 20); for (int s=0;s<1<<max;++s) { long prd=1; for (int i=0;i<max;++i) { if ((s>>i)%2==1) { prd*=i+1; } } if (prd<=K) ++ans; if (prd<dp2.length) dp2[(int)prd]++; ans += Math.max(0, Math.min(N, K/prd)-20); long n=N; for (int m=21;m<=N;++m) { n=Math.min(N, K/m/prd); if (m>=n) break; ans += n-m; } } for (int i=1;i<dp2.length;++i) dp2[i]+=dp2[i-1]; ans+=dfs(dp, dp2, 0, N, 1, K); System.out.println(ans-1); } static 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()); } }