結果
問題 | No.147 試験監督(2) |
ユーザー | tenten |
提出日時 | 2023-05-01 14:11:47 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 790 ms / 2,000 ms |
コード長 | 3,888 bytes |
コンパイル時間 | 3,729 ms |
コンパイル使用メモリ | 92,900 KB |
実行使用メモリ | 49,036 KB |
最終ジャッジ日時 | 2024-11-20 13:31:21 |
合計ジャッジ時間 | 8,365 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 790 ms
48,544 KB |
testcase_01 | AC | 774 ms
49,036 KB |
testcase_02 | AC | 790 ms
46,192 KB |
testcase_03 | AC | 54 ms
37,324 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { static final int MOD = 1000000007; static long base; static HashMap<Long, Long> dp = new HashMap<>(); public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); long[][] dp = new long[60][4]; dp[0] = new long[]{1, 0, 0, 1}; for (int i = 1; i < 60; i++) { for (int a = 0; a < 4; a++) { for (int b = 0; b < 4; b++) { if (a % 2 == 1 && b >= 2) { continue; } int idx = (a >> 1 << 1) + b % 2; dp[i][idx] += dp[i - 1][a] * dp[i - 1][b] % MOD; dp[i][idx] %= MOD; } } } long result = 1; while (n-- > 0) { long k = sc.nextLong(); long[] ans = null; for (int i = 59; i >= 0; i--) { if (k < (1L << i)) { continue; } k -= (1L << i); if (ans == null) { ans = new long[4]; for (int a = 0; a < 4; a++) { ans[a] = dp[i][a]; } continue; } long[] next = new long[4]; for (int a = 0; a < 4; a++) { for (int b = 0; b < 4; b++) { if (a % 2 == 1 && b >= 2) { continue; } int idx = (a >> 1 << 1) + b % 2; next[idx] += ans[a] * dp[i][b] % MOD; next[idx] %= MOD; } } ans = next; } result *= pow(getAmount(ans), sc.next().toCharArray()); result %= MOD; } System.out.println(result); } 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; } } static long pow(long x, char[] s) { long ans = 1; for (int i = s.length - 1; i >= 0; i--) { ans *= pow(x, s[i] - '0'); ans %= MOD; x = pow(x, 10); } return ans; } static long getAmount(long[] arr) { long ans = 0; for (long x : arr) { ans += x; ans %= MOD; } return ans; } } 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(); } }