結果
問題 | No.1100 Boxes |
ユーザー | convexineq |
提出日時 | 2023-07-10 16:57:15 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 305 ms / 2,000 ms |
コード長 | 2,499 bytes |
コンパイル時間 | 653 ms |
コンパイル使用メモリ | 87,200 KB |
実行使用メモリ | 104,092 KB |
最終ジャッジ日時 | 2023-10-10 01:12:36 |
合計ジャッジ時間 | 9,449 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 100 ms
91,588 KB |
testcase_01 | AC | 97 ms
91,652 KB |
testcase_02 | AC | 99 ms
91,812 KB |
testcase_03 | AC | 101 ms
91,652 KB |
testcase_04 | AC | 95 ms
91,716 KB |
testcase_05 | AC | 96 ms
91,584 KB |
testcase_06 | AC | 98 ms
91,536 KB |
testcase_07 | AC | 99 ms
91,796 KB |
testcase_08 | AC | 95 ms
91,856 KB |
testcase_09 | AC | 96 ms
91,884 KB |
testcase_10 | AC | 95 ms
91,736 KB |
testcase_11 | AC | 95 ms
91,680 KB |
testcase_12 | AC | 95 ms
91,596 KB |
testcase_13 | AC | 94 ms
91,736 KB |
testcase_14 | AC | 101 ms
91,752 KB |
testcase_15 | AC | 100 ms
91,924 KB |
testcase_16 | AC | 100 ms
91,808 KB |
testcase_17 | AC | 113 ms
92,396 KB |
testcase_18 | AC | 116 ms
92,316 KB |
testcase_19 | AC | 126 ms
93,336 KB |
testcase_20 | AC | 134 ms
94,520 KB |
testcase_21 | AC | 189 ms
97,856 KB |
testcase_22 | AC | 266 ms
103,144 KB |
testcase_23 | AC | 193 ms
97,832 KB |
testcase_24 | AC | 197 ms
98,080 KB |
testcase_25 | AC | 199 ms
98,228 KB |
testcase_26 | AC | 280 ms
103,748 KB |
testcase_27 | AC | 282 ms
103,280 KB |
testcase_28 | AC | 161 ms
95,672 KB |
testcase_29 | AC | 290 ms
103,568 KB |
testcase_30 | AC | 285 ms
102,972 KB |
testcase_31 | AC | 168 ms
95,976 KB |
testcase_32 | AC | 216 ms
98,696 KB |
testcase_33 | AC | 305 ms
103,900 KB |
testcase_34 | AC | 300 ms
104,016 KB |
testcase_35 | AC | 104 ms
91,660 KB |
testcase_36 | AC | 247 ms
104,092 KB |
testcase_37 | AC | 97 ms
91,760 KB |
testcase_38 | AC | 191 ms
98,236 KB |
testcase_39 | AC | 276 ms
103,640 KB |
ソースコード
SIZE=10**6+1 MOD = 998244353 ROOT = 3 roots = [pow(ROOT,(MOD-1)>>i,MOD) for i in range(24)] # 1 の 2^i 乗根 iroots = [pow(x,MOD-2,MOD) for x in roots] # 1 の 2^i 乗根の逆元 def untt(a,n): for i in range(n): m = 1<<(n-i-1) for s in range(1<<i): w_N = 1 s *= m*2 for p in range(m): a[s+p], a[s+p+m] = (a[s+p]+a[s+p+m])%MOD, (a[s+p]-a[s+p+m])*w_N%MOD w_N = w_N*roots[n-i]%MOD def iuntt(a,n): for i in range(n): m = 1<<i for s in range(1<<(n-i-1)): w_N = 1 s *= m*2 for p in range(m): a[s+p], a[s+p+m] = (a[s+p]+a[s+p+m]*w_N)%MOD, (a[s+p]-a[s+p+m]*w_N)%MOD w_N = w_N*iroots[i+1]%MOD inv = pow((MOD+1)//2,n,MOD) for i in range(1<<n): a[i] = a[i]*inv%MOD def convolution(a,b): la = len(a) lb = len(b) if min(la, lb) <= 50: if la < lb: la,lb = lb,la a,b = b,a res = [0]*(la+lb-1) for i in range(la): for j in range(lb): res[i+j] += a[i]*b[j] res[i+j] %= MOD return res deg = la+lb-2 n = deg.bit_length() N = 1<<n a += [0]*(N-len(a)) b += [0]*(N-len(b)) untt(a,n) untt(b,n) for i in range(N): a[i] = a[i]*b[i]%MOD iuntt(a,n) return a[:deg+1] #inv = [0]*SIZE # inv[j] = j^{-1} mod MOD fac = [0]*SIZE # fac[j] = j! mod MOD finv = [0]*SIZE # finv[j] = (j!)^{-1} mod MOD fac[0] = fac[1] = 1 finv[0] = finv[1] = 1 for i in range(2,SIZE): fac[i] = fac[i-1]*i%MOD finv[-1] = pow(fac[-1],MOD-2,MOD) for i in range(SIZE-1,0,-1): finv[i-1] = finv[i]*i%MOD #inv[i] = finv[i]*fac[i-1]%MOD def polynomial_Taylor_shift(f,c): N = len(f) f = f[:] g = [1]*N cc = c for i in range(1,N): f[i] = f[i]*fac[i]%MOD g[N-i-1] = cc*finv[i]%MOD cc = cc*c%MOD h = convolution(f,g)[N-1:] for i in range(N): h[i] = h[i]*finv[i]%MOD return h def choose(n,r): # nCk mod MOD の計算 if 0 <= r <= n: return (fac[n]*finv[r]%MOD)*finv[n-r]%MOD else: return 0 ############################################################### import sys readline = sys.stdin.readline n,k = map(int,readline().split()) g = [pow(i,n,MOD)*choose(k,i)%MOD for i in range(k+1)] g = g[::-1] f = polynomial_Taylor_shift(g,-1) f = f[::-1] ans = sum(f[(k+1)%2::2])%MOD print(ans)