結果
問題 | No.1973 Divisor Sequence |
ユーザー | tenten |
提出日時 | 2023-07-24 17:13:47 |
言語 | Java21 (openjdk 21) |
結果 |
MLE
|
実行時間 | - |
コード長 | 3,320 bytes |
コンパイル時間 | 3,493 ms |
コンパイル使用メモリ | 85,160 KB |
実行使用メモリ | 749,988 KB |
最終ジャッジ日時 | 2024-04-08 21:16:20 |
合計ジャッジ時間 | 10,950 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 58 ms
53,992 KB |
testcase_01 | AC | 56 ms
54,000 KB |
testcase_02 | AC | 96 ms
55,632 KB |
testcase_03 | AC | 94 ms
55,668 KB |
testcase_04 | AC | 109 ms
55,924 KB |
testcase_05 | AC | 82 ms
55,612 KB |
testcase_06 | AC | 107 ms
55,580 KB |
testcase_07 | AC | 100 ms
55,672 KB |
testcase_08 | AC | 102 ms
55,592 KB |
testcase_09 | AC | 129 ms
55,868 KB |
testcase_10 | AC | 135 ms
55,996 KB |
testcase_11 | AC | 98 ms
55,720 KB |
testcase_12 | AC | 100 ms
55,644 KB |
testcase_13 | AC | 115 ms
55,648 KB |
testcase_14 | AC | 1,731 ms
66,004 KB |
testcase_15 | AC | 120 ms
56,008 KB |
testcase_16 | AC | 94 ms
55,816 KB |
testcase_17 | AC | 109 ms
56,024 KB |
testcase_18 | AC | 135 ms
56,036 KB |
testcase_19 | AC | 111 ms
56,028 KB |
testcase_20 | AC | 109 ms
53,948 KB |
testcase_21 | AC | 89 ms
55,636 KB |
testcase_22 | AC | 85 ms
55,904 KB |
testcase_23 | AC | 120 ms
56,044 KB |
testcase_24 | MLE | - |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { static final int MOD = 1000000007; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt() - 1; long m = sc.nextLong(); TreeSet<Long> each = new TreeSet<>(); for (long i = 1; i <= Math.sqrt(m); i++) { if (m % i == 0) { each.add(i); each.add(m / i); } } int idx = 0; int size = each.size(); long[] values = new long[size]; for (long x : each) { values[idx++] = x; } long[][][] matrix = new long[20][size][size]; for (int i = 0; i < size; i++) { for (int j = 0; j < size; j++) { if (m / values[i] < values[j]) { break; } if (each.contains(values[i] * values[j])) { matrix[0][i][j] = 1; } } } for (int i = 1; i < 20; i++) { for (int a = 0; a < size; a++) { for (int b = 0; b < size; b++) { for (int c = 0; c < size; c++) { matrix[i][a][c] += matrix[i - 1][a][b] * matrix[i - 1][b][c]; matrix[i][a][c] %= MOD; } } } } long[] ans = new long[size]; Arrays.fill(ans, 1); for (int i = 19; i >= 0; i--) { if (n < (1 << i)) { continue; } n -= (1 << i); long[] next = new long[size]; for (int a = 0; a < size; a++) { for (int b = 0; b < size; b++) { next[a] += matrix[i][a][b] * ans[b] % MOD; next[a] %= MOD; } } ans = next; } long result = 0; for (long x : ans) { result += x; result %= MOD; } System.out.println(result); } } 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(); } }