結果

問題 No.1704 Many Bus Stops (easy)
ユーザー tenten
提出日時 2024-01-11 17:50:22
言語 Java
(openjdk 23)
結果
AC  
実行時間 165 ms / 2,000 ms
コード長 3,101 bytes
コンパイル時間 2,847 ms
コンパイル使用メモリ 91,396 KB
実行使用メモリ 56,536 KB
最終ジャッジ日時 2024-09-27 20:39:06
合計ジャッジ時間 10,168 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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();
long rate = pow(3, MOD - 2);
long[][][] matrix = new long[30][6][6];
matrix[0] = new long[][]{{0, 0, 0, 1, 0, 0}, {0, 0, 0, 0, 1, 0}, {0, 0, 0, 0, 0, 1}, {0, rate, rate, rate, 0, 0}, {rate, 0, rate, 0, rate, 0},
            {rate, rate, 0, 0, 0, rate}};
for (int i = 1; i < 30; 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];
matrix[i][a][c] %= MOD;
}
}
}
}
StringBuilder sb = new StringBuilder();
while (n-- > 0) {
int k = sc.nextInt();
long[] ans = new long[]{1, 0, 0, rate, 0, 0};
for (int i = 29; i >= 0; i--) {
if (k < (1 << i)) {
continue;
}
k -= (1 << 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;
}
sb.append(ans[0]).append("\n");
}
System.out.print(sb);
}
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();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0