#931541 (PyPy3) No.2131 Concon Substrings (COuNt Version)

• 問題: No.2131 Concon Substrings (COuNt Version)
• ユーザー: Navier_Boltzmann
• 提出日時: 2023-11-25 14:44:03
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 900 ms / 2,000 ms
• コード長: 1,663 bytes
• コンパイル時間: 472 ms
• コンパイル使用メモリ: 82,464 KB
• 実行使用メモリ: 147,936 KB
• 最終ジャッジ日時: 2024-09-26 10:46:39
• 合計ジャッジ時間: 7,696 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 4
other	AC * 16

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline
N = int(input())
mod = 998244353
# class combination():
    
#     def __init__(self,N,p):
        
        
#         self.fact = [1, 1]  # fact[n] = (n! mod p)
#         self.factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
#         self.inv = [0, 1]  # factinv 計算用
#         self.p = p
        
#         for i in range(2, N + 1):
#             self.fact.append((self.fact[-1] * i) % p)
#             self.inv.append((-self.inv[p % i] * (p // i)) % p)
#             self.factinv.append((self.factinv[-1] * self.inv[-1]) % p)
        
#     def cmb(self,n, r):
#         if (r < 0) or (n < r):
#             return 0
#         r = min(r, n - r)
#         return self.fact[n] * self.factinv[r] * self.factinv[n-r] % self.p
        
# C = combination(10000)
M = N//3 + 1
dp = [[[0]*N for j in range(M+1)] for _ in range(3)]
dp[0][0][0] = 1
for i in range(N-1):
    
    
    for j in range(M):
        
        for k in range(3):
            
            #dp[k][j][i] 
            if k==2:
                dp[0][j+1][i+1] = (dp[0][j+1][i+1] + dp[k][j][i])%mod
            else:
                dp[k+1][j][i+1] = (dp[k+1][j][i+1] + dp[k][j][i])%mod
            
            dp[k][j][i+1] = (dp[k][j][i+1] + 25*dp[k][j][i])%mod
            if (k==0)&(j==0):
                dp[k][j][i+1] = (dp[k][j][i+1] + pow(25,i+1,mod))%mod
            
ans = 0
for j in range(M+1):
    
    ans += dp[2][j][-1]*(j+1)
    ans += dp[1][j][-1]*(j)
    ans += dp[0][j][-1]*(j)
    ans %= mod
# print(dp[2])
# print(dp)
print(ans)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX