#704164 (PyPy3) No.1693 Invasion

• 問題: No.1693 Invasion
• ユーザー: ygd.
• 提出日時: 2021-10-01 23:48:34
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 169 ms / 2,000 ms
• コード長: 1,271 bytes
• コンパイル時間: 185 ms
• コンパイル使用メモリ: 82,228 KB
• 実行使用メモリ: 79,232 KB
• 最終ジャッジ日時: 2024-07-19 17:04:10
• 合計ジャッジ時間: 3,513 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 21

ソースコード

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
import sys
input = sys.stdin.buffer.readline
#input = sys.stdin.readline
import copy
def cmb(n, r, p):
  if (r < 0) or (n < r):
    return 0
  r = min(r, n - r)
  ret = fac[n] * finv[r] % p
  ret = ret * finv[n-r] % p
  return ret
def perm(n,r,p):
  if (r < 0) or (n < r):
    return 0
  return fac[n]*finv[n-r]%p
n = 3*pow(10,5)
MOD = 998244353
fac = [-1]*(n+1); fac[0] = 1; fac[1] = 1 #階乗
finv = [-1]*(n+1); finv[0] = 1; finv[1] = 1 #階乗の逆元
inv = [-1]*(n+1); inv[0] = 0; inv[1] = 1 #逆元
for i in range(2,n+1):
  fac[i] = fac[i-1]*i%MOD
  inv[i] = MOD - inv[MOD%i]*(MOD//i)%MOD
  finv[i] = finv[i-1]*inv[i]%MOD
def main():
    n,m = map(int,input().split()); INF = pow(10,18)
    A = list(map(int,input().split()))
    #A = [a-1 for a in A]
    A.sort()
    #dp[i]: 全部でi個選ぶのに必要な最小操作回数
    dp = [INF]*(m+1)
    dp[0] = 0
    for i in range(n):
        #p = copy.copy(dp)
        #p,dp = dp,p
        a = A[i]
        for j in range(m+1):
            if j+A[i] <= m:
                dp[j+A[i]] = min(dp[j+A[i]], dp[j] + 1)
    #print(dp)
    ans = 0
    for p in range(m+1):
        x = dp[p]
        temp = cmb(m-x,p-x,MOD)
        ans += temp
        ans %= MOD
    print(ans)
if __name__ == '__main__':
    main()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX