結果
問題 | No.1704 Many Bus Stops (easy) |
ユーザー |
![]() |
提出日時 | 2021-10-08 23:24:52 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 273 ms / 2,000 ms |
コード長 | 1,497 bytes |
コンパイル時間 | 219 ms |
コンパイル使用メモリ | 82,144 KB |
実行使用メモリ | 78,316 KB |
最終ジャッジ日時 | 2024-07-23 07:25:31 |
合計ジャッジ時間 | 10,597 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 41 |
ソースコード
import syssys.setrecursionlimit(200005)int1 = lambda x: int(x)-1p2D = lambda x: print(*x, sep="\n")def II(): return int(sys.stdin.readline())def LI(): return list(map(int, sys.stdin.readline().split()))def LI1(): return list(map(int1, sys.stdin.readline().split()))def LLI(rows_number): return [LI() for _ in range(rows_number)]def LLI1(rows_number): return [LI1() for _ in range(rows_number)]def SI(): return sys.stdin.readline().rstrip()# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]inf = 10**19# md = 998244353md = 10**9+7def dot(aa, bb):h = len(aa)w = len(bb[0])res = [[0]*w for _ in range(h)]for i, row in enumerate(aa):for j, col in enumerate(zip(*bb)):v = 0# for a, b in zip(row, col): v += a*b# res[i][j] = v%mdfor a, b in zip(row, col): v += a*b%mdres[i][j] = v%mdreturn resdef matpow(e):n = 4res = [[1 if i == j else 0 for j in range(n)] for i in range(n)]i = 0while e:if e & 1: res = dot(res, mm[i])e >>= 1i += 1return resinv = pow(3, md-2, md)mat = [[0, 0, 0, inv], [0, 0, inv*2, inv], [1, 0, inv, 0], [0, 1, 0, inv]]lim = 10**9+5i = 1mm = []while i < lim:mm.append(mat)mat = dot(mat, mat)i <<= 1for _ in range(II()):n = II()print(matpow(n)[2][2])