結果
問題 | No.1810 RGB Biscuits |
ユーザー |
![]() |
提出日時 | 2023-07-20 11:10:32 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 131 ms / 2,000 ms |
コード長 | 3,019 bytes |
コンパイル時間 | 4,033 ms |
コンパイル使用メモリ | 90,804 KB |
実行使用メモリ | 56,524 KB |
最終ジャッジ日時 | 2023-10-20 12:19:30 |
合計ジャッジ時間 | 7,065 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
53,480 KB |
testcase_01 | AC | 55 ms
52,668 KB |
testcase_02 | AC | 54 ms
53,480 KB |
testcase_03 | AC | 60 ms
53,484 KB |
testcase_04 | AC | 57 ms
53,472 KB |
testcase_05 | AC | 118 ms
55,860 KB |
testcase_06 | AC | 108 ms
55,824 KB |
testcase_07 | AC | 131 ms
56,524 KB |
testcase_08 | AC | 125 ms
56,312 KB |
testcase_09 | AC | 122 ms
56,340 KB |
testcase_10 | AC | 111 ms
55,544 KB |
testcase_11 | AC | 83 ms
54,340 KB |
testcase_12 | AC | 55 ms
52,668 KB |
testcase_13 | AC | 56 ms
53,476 KB |
testcase_14 | AC | 71 ms
52,768 KB |
testcase_15 | AC | 57 ms
53,500 KB |
testcase_16 | AC | 56 ms
53,484 KB |
testcase_17 | AC | 105 ms
54,784 KB |
testcase_18 | AC | 104 ms
54,328 KB |
testcase_19 | AC | 59 ms
53,484 KB |
testcase_20 | AC | 56 ms
53,468 KB |
testcase_21 | AC | 60 ms
53,488 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(); int a = sc.nextInt(); int b = sc.nextInt(); int n = sc.nextInt(); long[][][] matrix = new long[60][2][2]; matrix[0] = new long[][]{{a, b}, {1, 0}}; for (int i = 1; i < 60; i++) { for (int c = 0; c < 2; c++) { for (int d = 0; d < 2; d++) { for (int e = 0; e < 2; e++) { matrix[i][c][e] += matrix[i - 1][c][d] * matrix[i - 1][d][e] % MOD; matrix[i][c][e] %= MOD; } } } } StringBuilder sb = new StringBuilder(); while (n-- > 0) { long t = sc.nextLong(); boolean isAdd = (t % 2 == 1); t /= 2; long[] ans = new long[2]; ans[0] = 1; ans[1] = 1; for (int i = 59; i >= 0; i--) { if (t < (1L << i)) { continue; } t -= (1L << i); long[] next = new long[2]; for (int c = 0; c < 2; c++) { for (int d = 0; d < 2; d++) { next[c] += matrix[i][c][d] * ans[d] % MOD; next[c] %= MOD; } } ans = next; } if (isAdd) { sb.append((ans[0] * (a + 1) + ans[1] * (b + 1)) % MOD).append("\n"); } else { sb.append((ans[0] + ans[1]) % MOD).append("\n"); } } System.out.print(sb); } } 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(); } }