結果

問題 No.1704 Many Bus Stops (easy)
ユーザー gr1msl3y
提出日時 2021-10-08 23:27:01
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 180 ms / 2,000 ms
コード長 939 bytes
コンパイル時間 305 ms
コンパイル使用メモリ 82,504 KB
実行使用メモリ 77,360 KB
最終ジャッジ日時 2024-07-23 07:30:26
合計ジャッジ時間 8,030 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

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

MOD = 10**9+7
A = [[0]*4 for _ in range(4)]
inv3 = pow(3, MOD-2, MOD)
A[0][2] = A[1][3] = 1
A[2][1] = A[2][2] = A[3][1] = A[3][3] = inv3
A[3][0] = 2*inv3 % MOD
def multiple(X, Y):
r = len(X)
c = len(Y[0])
n = len(Y)
Z = [[0]*c for _ in range(r)]
for i in range(r):
for j in range(c):
for k in range(n):
Z[i][j] += X[i][k]*Y[k][j] % MOD
Z[i][j] %= MOD
return Z
M = 30
B = []
B.append(A)
for _ in range(M):
B.append(multiple(B[-1], B[-1]))
def solve(n):
C = [[0]*4 for _ in range(4)]
for i in range(4):
C[i][i] = 1
for i in range(M):
if (n >> i) & 1:
C = multiple(B[i], C)
ans = [[1], [0], [inv3], [0]]
ans = multiple(C, ans)
return ans[0][0]
def main():
T = int(input())
ans = [0]*T
for i in range(T):
N = int(input())
ans[i] = solve(N)
print(*ans, sep='\n')
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0