結果
問題 | No.1073 無限すごろく |
ユーザー | tenten |
提出日時 | 2023-06-21 09:51:53 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 53 ms / 2,000 ms |
コード長 | 3,115 bytes |
コンパイル時間 | 3,232 ms |
コンパイル使用メモリ | 84,980 KB |
実行使用メモリ | 37,356 KB |
最終ジャッジ日時 | 2024-06-28 19:42:36 |
合計ジャッジ時間 | 4,979 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
37,248 KB |
testcase_01 | AC | 53 ms
36,684 KB |
testcase_02 | AC | 50 ms
37,316 KB |
testcase_03 | AC | 51 ms
36,808 KB |
testcase_04 | AC | 52 ms
37,156 KB |
testcase_05 | AC | 51 ms
36,884 KB |
testcase_06 | AC | 52 ms
36,684 KB |
testcase_07 | AC | 52 ms
37,048 KB |
testcase_08 | AC | 52 ms
37,340 KB |
testcase_09 | AC | 53 ms
37,356 KB |
testcase_10 | AC | 53 ms
37,200 KB |
testcase_11 | AC | 53 ms
37,184 KB |
testcase_12 | AC | 52 ms
37,220 KB |
testcase_13 | AC | 52 ms
37,192 KB |
testcase_14 | AC | 51 ms
37,320 KB |
testcase_15 | AC | 52 ms
37,120 KB |
testcase_16 | AC | 51 ms
36,796 KB |
testcase_17 | AC | 52 ms
36,828 KB |
testcase_18 | AC | 50 ms
37,280 KB |
testcase_19 | AC | 51 ms
37,084 KB |
testcase_20 | AC | 50 ms
37,328 KB |
testcase_21 | AC | 51 ms
37,208 KB |
testcase_22 | AC | 51 ms
36,808 KB |
testcase_23 | AC | 50 ms
36,812 KB |
testcase_24 | AC | 49 ms
36,828 KB |
testcase_25 | AC | 49 ms
36,800 KB |
testcase_26 | AC | 48 ms
37,228 KB |
testcase_27 | AC | 48 ms
37,016 KB |
testcase_28 | AC | 49 ms
37,256 KB |
testcase_29 | AC | 49 ms
37,144 KB |
testcase_30 | AC | 49 ms
37,184 KB |
testcase_31 | AC | 51 ms
36,776 KB |
testcase_32 | AC | 49 ms
37,008 KB |
ソースコード
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(); long n = sc.nextLong(); long[][][] matrix = new long[60][6][6]; long rate = pow(6, MOD - 2); matrix[0] = new long[][]{{0, 1, 0, 0, 0, 0}, {0, 0, 1, 0, 0, 0}, {0, 0, 0, 1, 0, 0}, {0, 0, 0, 0, 1, 0}, {0, 0, 0, 0, 0, 1}, {rate, rate, rate, rate, rate, rate}}; for (int i = 1; i < 60; i++) { for (int a = 0; a < 6; a++) { for (int b = 0; b < 6; b++) { for (int c = 0; c < 6; c++) { matrix[i][a][c] += matrix[i - 1][a][b] * matrix[i - 1][b][c] % MOD; matrix[i][a][c] %= MOD; } } } } long[] ans = new long[6]; ans[0] = 1; for (int i = 1; i < 6; i++) { long sum = 0; for (int j = 0; j < i; j++) { sum += ans[j]; sum %= MOD; } ans[i] = sum * rate % MOD; } for (int i = 59; i >= 0; i--) { if (n < (1L << i)) { continue; } n -= (1L << i); long[] next = new long[6]; for (int a = 0; a < 6; a++) { for (int b = 0; b < 6; b++) { next[a] += matrix[i][a][b] * ans[b] % MOD; next[a] %= MOD; } } ans = next; } System.out.println(ans[0]); } static long pow(long x, int p) { if (p == 0) { return 1; } else if (p % 2 == 0) { return pow(x * x % MOD, p / 2); } else { return pow(x, p - 1) * x % MOD; } } } 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(); } }