結果
問題 | No.1387 Mitarushi's Remodeling |
ユーザー | Mitarushi |
提出日時 | 2021-01-20 22:55:30 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 883 ms / 2,000 ms |
コード長 | 1,903 bytes |
コンパイル時間 | 292 ms |
コンパイル使用メモリ | 86,928 KB |
実行使用メモリ | 210,760 KB |
最終ジャッジ日時 | 2023-09-12 10:37:20 |
合計ジャッジ時間 | 54,978 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 109 ms
100,000 KB |
testcase_01 | AC | 109 ms
100,080 KB |
testcase_02 | AC | 111 ms
99,872 KB |
testcase_03 | AC | 109 ms
100,184 KB |
testcase_04 | AC | 109 ms
100,076 KB |
testcase_05 | AC | 110 ms
100,000 KB |
testcase_06 | AC | 111 ms
99,876 KB |
testcase_07 | AC | 109 ms
100,104 KB |
testcase_08 | AC | 149 ms
102,268 KB |
testcase_09 | AC | 145 ms
102,420 KB |
testcase_10 | AC | 150 ms
102,152 KB |
testcase_11 | AC | 149 ms
102,324 KB |
testcase_12 | AC | 146 ms
102,168 KB |
testcase_13 | AC | 149 ms
102,224 KB |
testcase_14 | AC | 855 ms
206,952 KB |
testcase_15 | AC | 849 ms
206,868 KB |
testcase_16 | AC | 846 ms
206,880 KB |
testcase_17 | AC | 852 ms
207,508 KB |
testcase_18 | AC | 883 ms
206,972 KB |
testcase_19 | AC | 874 ms
207,028 KB |
testcase_20 | AC | 859 ms
207,200 KB |
testcase_21 | AC | 864 ms
206,168 KB |
testcase_22 | AC | 879 ms
207,012 KB |
testcase_23 | AC | 871 ms
206,864 KB |
testcase_24 | AC | 864 ms
206,752 KB |
testcase_25 | AC | 860 ms
206,960 KB |
testcase_26 | AC | 878 ms
206,628 KB |
testcase_27 | AC | 858 ms
206,688 KB |
testcase_28 | AC | 858 ms
206,432 KB |
testcase_29 | AC | 854 ms
207,420 KB |
testcase_30 | AC | 852 ms
207,068 KB |
testcase_31 | AC | 862 ms
206,696 KB |
testcase_32 | AC | 867 ms
207,024 KB |
testcase_33 | AC | 865 ms
206,424 KB |
testcase_34 | AC | 864 ms
207,240 KB |
testcase_35 | AC | 856 ms
206,844 KB |
testcase_36 | AC | 858 ms
206,732 KB |
testcase_37 | AC | 855 ms
206,692 KB |
testcase_38 | AC | 864 ms
207,172 KB |
testcase_39 | AC | 852 ms
207,084 KB |
testcase_40 | AC | 855 ms
206,856 KB |
testcase_41 | AC | 863 ms
207,276 KB |
testcase_42 | AC | 865 ms
207,260 KB |
testcase_43 | AC | 863 ms
206,452 KB |
testcase_44 | AC | 865 ms
206,944 KB |
testcase_45 | AC | 856 ms
206,496 KB |
testcase_46 | AC | 865 ms
206,484 KB |
testcase_47 | AC | 857 ms
207,380 KB |
testcase_48 | AC | 851 ms
207,412 KB |
testcase_49 | AC | 862 ms
207,032 KB |
testcase_50 | AC | 863 ms
207,388 KB |
testcase_51 | AC | 863 ms
206,952 KB |
testcase_52 | AC | 863 ms
206,264 KB |
testcase_53 | AC | 852 ms
206,640 KB |
testcase_54 | AC | 867 ms
206,500 KB |
testcase_55 | AC | 869 ms
206,764 KB |
testcase_56 | AC | 856 ms
206,904 KB |
testcase_57 | AC | 853 ms
206,672 KB |
testcase_58 | AC | 859 ms
206,884 KB |
testcase_59 | AC | 852 ms
206,876 KB |
testcase_60 | AC | 846 ms
206,936 KB |
testcase_61 | AC | 859 ms
206,576 KB |
testcase_62 | AC | 859 ms
206,460 KB |
testcase_63 | AC | 871 ms
207,844 KB |
testcase_64 | AC | 850 ms
207,860 KB |
testcase_65 | AC | 857 ms
207,312 KB |
testcase_66 | AC | 855 ms
207,728 KB |
testcase_67 | AC | 851 ms
207,524 KB |
testcase_68 | AC | 878 ms
207,316 KB |
testcase_69 | AC | 858 ms
210,760 KB |
ソースコード
import sys input = sys.stdin.readline mod = 998244353 max_kai = 10**6+10 kai = [1] * max_kai for i in range(1, max_kai): kai[i] = kai[i-1] * i % mod kkai = [0] * max_kai kkai[-1] = pow(kai[-1], mod - 2, mod) for i in reversed(range(1, max_kai)): kkai[i - 1] = kkai[i] * i % mod kkai_sum = [0]*(max_kai+1) for i in range(max_kai): kkai_sum[i+1] = (kkai_sum[i] + kkai[i]) % mod def cutsum(a, b): return kkai_sum[a] - kkai_sum[max(0, b)] def fft_inplace(a, w): n = len(a) m = n t = 1 while m >= 2: mh = m >> 1 for i in range(0, n, m): for s in range(mh): j, k = i+s, i+mh+s a[j], a[k] = (a[j]+a[k]) % mod, (a[j]-a[k])*w[s*t] % mod m = mh t *= 2 def ifft_inplace(a, w): n = len(a) m = 2 t = -(n >> 1) while m <= n: mh = m >> 1 for i in range(0, n, m): for s in range(mh): j, k = i+s, i+mh+s a[k] *= w[s*t] a[j], a[k] = (a[j]+a[k]) % mod, (a[j]-a[k]) % mod m <<= 1 t //= 2 n_inv = pow(n, mod-2, mod) for i in range(n): a[i] = a[i] * n_inv % mod def convolution(a, b): n2 = max(len(a) + len(b), 1) n = 1 << (n2-1).bit_length() a = a + [0] * (n-len(a)) b = b + [0] * (n-len(b)) w_root = pow(3, (mod-1)//n, mod) w = [1] * n for i in range(1, n): w[i] = w[i-1] * w_root % mod fft_inplace(a, w) fft_inplace(b, w) for i, j in enumerate(b): a[i] = a[i] * j % mod ifft_inplace(a, w) return a[:n2] n, k = map(int, input().split()) m = [int(i)+1 for i in input().split()] b = convolution(m, m[::-1]) ans = 0 for i in range(n): ans += b[i] * (kai[n-1] * cutsum(n-1, n-k-1) - kai[i]*cutsum(i, i-k)) ans %= mod for i in m: ans *= i-1 ans %= mod ans *= pow(4, mod-2, mod) ans %= mod print(ans)