結果
問題 | No.1811 EQUIV Ten |
ユーザー | mkawa2 |
提出日時 | 2022-01-14 22:28:28 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 228 ms / 2,000 ms |
コード長 | 2,092 bytes |
コンパイル時間 | 159 ms |
コンパイル使用メモリ | 82,572 KB |
実行使用メモリ | 91,664 KB |
最終ジャッジ日時 | 2024-04-30 15:51:35 |
合計ジャッジ時間 | 4,908 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 58 ms
76,288 KB |
testcase_01 | AC | 57 ms
75,628 KB |
testcase_02 | AC | 69 ms
81,376 KB |
testcase_03 | AC | 57 ms
75,980 KB |
testcase_04 | AC | 58 ms
76,176 KB |
testcase_05 | AC | 58 ms
76,636 KB |
testcase_06 | AC | 59 ms
76,488 KB |
testcase_07 | AC | 59 ms
75,968 KB |
testcase_08 | AC | 59 ms
76,828 KB |
testcase_09 | AC | 58 ms
76,960 KB |
testcase_10 | AC | 60 ms
76,912 KB |
testcase_11 | AC | 200 ms
91,568 KB |
testcase_12 | AC | 210 ms
91,568 KB |
testcase_13 | AC | 221 ms
91,228 KB |
testcase_14 | AC | 226 ms
91,476 KB |
testcase_15 | AC | 228 ms
91,356 KB |
testcase_16 | AC | 58 ms
76,092 KB |
testcase_17 | AC | 72 ms
83,656 KB |
testcase_18 | AC | 73 ms
83,696 KB |
testcase_19 | AC | 70 ms
81,100 KB |
testcase_20 | AC | 85 ms
91,496 KB |
testcase_21 | AC | 84 ms
91,228 KB |
testcase_22 | AC | 73 ms
83,276 KB |
testcase_23 | AC | 130 ms
91,336 KB |
testcase_24 | AC | 90 ms
91,352 KB |
testcase_25 | AC | 74 ms
83,400 KB |
testcase_26 | AC | 118 ms
91,520 KB |
testcase_27 | AC | 75 ms
87,736 KB |
testcase_28 | AC | 59 ms
77,192 KB |
testcase_29 | AC | 68 ms
81,716 KB |
testcase_30 | AC | 197 ms
91,664 KB |
testcase_31 | AC | 77 ms
89,628 KB |
testcase_32 | AC | 88 ms
91,432 KB |
testcase_33 | AC | 90 ms
91,512 KB |
testcase_34 | AC | 192 ms
91,644 KB |
testcase_35 | AC | 118 ms
91,392 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) 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), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 18446744073709551615 # inf = 4294967295 md = 10**9+7 # md = 998244353 def nHr(hn, hr): return nCr(hn+hr-1, hr-1) def nPr(com_n, com_r): if com_r < 0: return 0 if com_n < com_r: return 0 return fac[com_n]*ifac[com_n-com_r]%md def nCr(com_n, com_r): if com_r < 0: return 0 if com_n < com_r: return 0 return fac[com_n]*ifac[com_r]%md*ifac[com_n-com_r]%md # 準備 n_max = 200005 fac = [1] for i in range(1, n_max+1): fac.append(fac[-1]*i%md) ifac = [1]*(n_max+1) ifac[n_max] = pow(fac[n_max], md-2, md) for i in range(n_max-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%md n = II() if n < 4: print(0) exit() dp = [[0]*2 for _ in range(8)] dp[0][0] = 1 for _ in range(n): ndp = [[0]*2 for _ in range(8)] for s in range(8): for f in range(2): pre = dp[s][f] if pre == 0: continue ns = (s%4) << 1 if f: ndp[ns][f] += pre ndp[ns | 1][f] += pre ndp[ns][f] %= md ndp[ns | 1][f] %= md else: if s == 5: ndp[ns][1] += pre ndp[ns][1] %= md else: ndp[ns][0] += pre ndp[ns][0] %= md ndp[ns | 1][f] += pre ndp[ns | 1][f] %= md dp = ndp # pDB(dp) ans = 0 for s in range(8): ans += dp[s][1] ans %= md print(ans)