結果
| 問題 | No.1766 Tatsujin Remix |
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2026-11-14 19:50:10 |
| 言語 | PyPy3 (8.0.1 + ACL) |
| 結果 |
AC
不安定
|
| 実行時間 | 225 ms / 2,000 ms |
| + 76µs | |
| コード長 | 2,744 bytes |
| 記録 | |
| コンパイル時間 | 86 ms |
| コンパイル使用メモリ | 64,472 KB |
| 実行使用メモリ | 97,976 KB |
| 最終ジャッジ日時 | 2026-11-14 19:50:17 |
| 合計ジャッジ時間 | 6,689 ms |
|
ジャッジサーバーID (参考情報) |
judge3_0 / judge2_0 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 22 |
ソースコード
N = int(input())
MOD = 998244353
S = ""
for _ in range(N):
S += input().strip()
S = "0"+S
M = 16*N
dp = [[0 for _ in range(9)] for _ in range(M+1)]
if S[1]=="." and S[2]==".":
dp[2][0] = 1
dp[2][3] = 1
dp[2][4] = 1
dp[2][5] = 1
dp[2][6] = 1
dp[2][7] = 1
dp[2][8] = 1
elif S[1]=="." and S[2]=="d":
dp[2][7] = 1
elif S[1]=="." and S[2]=="k":
dp[2][5] = 1
elif S[1]=="d" and S[2]==".":
dp[2][3] = 1
dp[2][4] = 1
dp[2][5] = 1
elif S[1]=="d" and S[2]=="d":
dp[2][4] = 1
elif S[1]=="d" and S[2]=="k":
dp[2][5] = 1
elif S[1]=="k" and S[2]==".":
dp[2][6] = 1
dp[2][7] = 1
dp[2][8] = 1
elif S[1]=="k" and S[2]=="d":
dp[2][7] = 1
elif S[1]=="k" and S[2]=="k":
dp[2][8] = 1
for i in range(3,M+1):
if S[i-1]=="." and S[i]==".":
if (i-1)%2==1:
dp[i][0] = (dp[i][0]+dp[i-1][0])%MOD
else:
for j in range(3):
dp[i][j] = (dp[i][j]+dp[i-1][0]+dp[i-1][3]+dp[i-1][6])%MOD
for j in range(3,6):
dp[i][j] = (dp[i][j]+dp[i-1][1]+dp[i-1][4]+dp[i-1][7])%MOD
for j in range(6,9):
dp[i][j] = (dp[i][j]+dp[i-1][2]+dp[i-1][5]+dp[i-1][8])%MOD
if i%2==1:
dp[i][3] = 0
dp[i][6] = 0
elif S[i-1]=="." and S[i]=="d":
dp[i][1] = (dp[i][1]+dp[i-1][0]+dp[i-1][3]+dp[i-1][6])%MOD
dp[i][7] = (dp[i][7]+dp[i-1][2]+dp[i-1][5]+dp[i-1][8])%MOD
if (i-1)%2==1:
dp[i][1] = 0
elif S[i-1]=="." and S[i]=="k":
dp[i][2] = (dp[i][2]+dp[i-1][0]+dp[i-1][3]+dp[i-1][6])%MOD
dp[i][5] = (dp[i][5]+dp[i-1][1]+dp[i-1][4]+dp[i-1][7])%MOD
if (i-1)%2==1:
dp[i][2] = 0
elif S[i-1]=="d" and S[i]==".":
dp[i][3] = (dp[i][3]+dp[i-1][1]+dp[i-1][4]+dp[i-1][7])%MOD
dp[i][4] = (dp[i][4]+dp[i-1][1]+dp[i-1][4]+dp[i-1][7])%MOD
dp[i][5] = (dp[i][5]+dp[i-1][1]+dp[i-1][4]+dp[i-1][7])%MOD
if i%2==1:
dp[i][3] = 0
elif S[i-1]=="d" and S[i]=="d":
dp[i][4] = (dp[i][4]+dp[i-1][1]+dp[i-1][4]+dp[i-1][7])%MOD
elif S[i-1]=="d" and S[i]=="k":
dp[i][5] = (dp[i][5]+dp[i-1][1]+dp[i-1][4]+dp[i-1][7])%MOD
elif S[i-1]=="k" and S[i]==".":
dp[i][6] = (dp[i][6]+dp[i-1][2]+dp[i-1][5]+dp[i-1][8])%MOD
dp[i][7] = (dp[i][7]+dp[i-1][2]+dp[i-1][5]+dp[i-1][8])%MOD
dp[i][8] = (dp[i][8]+dp[i-1][2]+dp[i-1][5]+dp[i-1][8])%MOD
if i%2==1:
dp[i][6] = 0
elif S[i-1]=="k" and S[i]=="d":
dp[i][7] = (dp[i][7]+dp[i-1][2]+dp[i-1][5]+dp[i-1][8])%MOD
elif S[i-1]=="k" and S[i]=="k":
dp[i][8] = (dp[i][8]+dp[i-1][2]+dp[i-1][5]+dp[i-1][8])%MOD
ans = 0
for j in range(9):
ans = (ans+dp[M][j])%MOD
print(ans)