結果
問題 |
No.1073 無限すごろく
|
ユーザー |
![]() |
提出日時 | 2021-05-28 00:47:14 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,357 bytes |
コンパイル時間 | 967 ms |
コンパイル使用メモリ | 82,380 KB |
実行使用メモリ | 70,256 KB |
最終ジャッジ日時 | 2024-11-06 18:16:25 |
合計ジャッジ時間 | 3,113 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 28 WA * 2 |
ソースコード
import sys sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.buffer.readline()) def LI(): return list(map(int, sys.stdin.buffer.readline().split())) def LI1(): return list(map(int1, sys.stdin.buffer.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 BI(): return sys.stdin.buffer.readline().rstrip() def SI(): return sys.stdin.buffer.readline().rstrip().decode() # 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)] dij = [(0, 1), (1, 0), (1, 1), (1, -1)] inf = 10**16 # md = 998244353 md = 10**9+7 p = 166666668 n = II() xx = [1]*6 for i in range(1, 6): xx[i] = sum(xx[j]*p%md for j in range(i)) if n < 6: print(xx[n]) exit() def dot(aa, bb): return [[sum(a*b%md for a, b in zip(row, col))%md for col in zip(*bb)] for row in aa] n -= 5 base = [[0, 0, 0, 0, 0, p], [1, 0, 0, 0, 0, p], [0, 1, 0, 0, 0, p], [0, 0, 1, 0, 0, p], [0, 0, 0, 1, 0, p], [0, 0, 0, 0, 1, p]] cc = [[1 if i == j else 0 for j in range(6)] for i in range(6)] while n: if n & 1: cc = dot(cc, base) base = dot(base, base) n >>= 1 [xx] = dot([xx], cc) print(xx[-1])