結果
問題 | No.1073 無限すごろく |
ユーザー | mkawa2 |
提出日時 | 2021-05-28 00:47:14 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,357 bytes |
コンパイル時間 | 505 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 69,248 KB |
最終ジャッジ日時 | 2024-04-24 10:38:33 |
合計ジャッジ時間 | 3,685 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
51,840 KB |
testcase_01 | AC | 41 ms
52,352 KB |
testcase_02 | AC | 54 ms
61,184 KB |
testcase_03 | AC | 41 ms
52,480 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 43 ms
52,352 KB |
testcase_07 | AC | 42 ms
52,224 KB |
testcase_08 | AC | 43 ms
52,864 KB |
testcase_09 | AC | 42 ms
52,864 KB |
testcase_10 | AC | 49 ms
58,752 KB |
testcase_11 | AC | 49 ms
59,008 KB |
testcase_12 | AC | 48 ms
59,264 KB |
testcase_13 | AC | 54 ms
61,312 KB |
testcase_14 | AC | 55 ms
61,312 KB |
testcase_15 | AC | 56 ms
61,568 KB |
testcase_16 | AC | 56 ms
61,440 KB |
testcase_17 | AC | 62 ms
64,128 KB |
testcase_18 | AC | 61 ms
64,128 KB |
testcase_19 | AC | 61 ms
63,360 KB |
testcase_20 | AC | 62 ms
63,360 KB |
testcase_21 | AC | 62 ms
64,384 KB |
testcase_22 | AC | 61 ms
63,872 KB |
testcase_23 | AC | 64 ms
66,304 KB |
testcase_24 | AC | 65 ms
66,048 KB |
testcase_25 | AC | 65 ms
66,176 KB |
testcase_26 | AC | 67 ms
66,688 KB |
testcase_27 | AC | 66 ms
65,792 KB |
testcase_28 | AC | 68 ms
68,736 KB |
testcase_29 | AC | 69 ms
69,120 KB |
testcase_30 | AC | 68 ms
68,224 KB |
testcase_31 | AC | 68 ms
68,352 KB |
testcase_32 | AC | 70 ms
69,248 KB |
ソースコード
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])