結果
問題 |
No.1740 Alone 'a'
|
ユーザー |
![]() |
提出日時 | 2021-11-24 23:57:29 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 195 ms / 2,000 ms |
コード長 | 806 bytes |
コンパイル時間 | 184 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 111,488 KB |
最終ジャッジ日時 | 2024-06-27 09:36:23 |
合計ジャッジ時間 | 6,670 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 38 |
ソースコード
n = int(input()) s = input() p = 998244353 alptonum = {"a":1,"b":2,"c":3,"d":4,"e":5,"f":6,"g":7,"h":8,"i":9,"j":10,"k":11,"l":12,"m":13,"n":14,"o":15,"p":16,"q":17,"r":18,"s":19,"t":20,"u":21,"v":22,"w":23,"x":24,"y":25,"z":26} dp = [[0 for i in range(2)] for j in range(n+1)] dp2 = [[0 for i in range(2)] for j in range(n+1)] dp2[0][0] = 1 for i in range(n): kari = alptonum[s[i]] if kari != 1: dp[i+1][0] = (dp[i][0] * 25 + dp2[i][0] * (kari - 2)) % p dp[i+1][1] = (dp[i][0] + dp2[i][0] + dp[i][1] * 25 + dp2[i][1] * (kari - 2)) % p dp2[i+1][0] = dp2[i][0] dp2[i+1][1] = dp2[i][1] else: dp[i+1][0] = (dp[i][0] * 25) % p dp[i+1][1] = (dp[i][0] + dp[i][1] * 25) % p dp2[i+1][1] = dp2[i][0] ans = (dp[n][1]) % p print("{}".format(ans))