結果

問題 No.2437 Fragile Multiples of 11
ユーザー 👑 SPD_9X2SPD_9X2
提出日時 2023-08-18 22:53:35
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 81 ms / 2,000 ms
コード長 1,395 bytes
コンパイル時間 621 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 68,736 KB
最終ジャッジ日時 2024-11-28 09:13:55
合計ジャッジ時間 4,132 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

"""
+,-mod 11011
A B C
A + B + C = 0
-A + C = 0
… A=C OK
A*2 + B = 0 B
dp[][mod11]
"""
import sys
from sys import stdin
N = int(stdin.readline())
X = list(map(int,list(stdin.readline()[:-1])))
dp = [[[0] * 11 for i in range(2)] for j in range(2)]
dp[0][1][0] = 1
mod = 998244353
for i in range(N):
ndp = [[[0] * 11 for i in range(2)] for j in range(2)]
for flag in range(2):
for d in range(10):
if flag == 1 and X[i] < d:
continue
elif flag == 1 and X[i] == d:
newflag = 1
else:
newflag = 0
if i % 2 == 1:
d *= -1
for dig_puted in range(2):
for oldd in range(11):
if (oldd*2 + d) % 11 == 0 and dig_puted != 0:
continue
newdigp = dig_puted
if d != 0:
newdigp |= 1
ndp[newdigp][newflag][(oldd+d)%11] += dp[dig_puted][flag][oldd]
ndp[newdigp][newflag][(oldd+d)%11] %= mod
dp = ndp
#print (dp)
ans = 0
for i in range(2):
ans += dp[1][i][0]
print (ans % mod)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0