結果
問題 | No.1387 Mitarushi's Remodeling |
ユーザー | chineristAC |
提出日時 | 2021-02-07 22:03:39 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,153 ms / 2,000 ms |
コード長 | 2,580 bytes |
コンパイル時間 | 575 ms |
コンパイル使用メモリ | 87,112 KB |
実行使用メモリ | 307,432 KB |
最終ジャッジ日時 | 2023-09-17 21:45:43 |
合計ジャッジ時間 | 63,463 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 108 ms
87,480 KB |
testcase_01 | AC | 127 ms
87,516 KB |
testcase_02 | AC | 112 ms
87,528 KB |
testcase_03 | AC | 109 ms
87,532 KB |
testcase_04 | AC | 109 ms
87,596 KB |
testcase_05 | AC | 117 ms
87,556 KB |
testcase_06 | AC | 112 ms
87,564 KB |
testcase_07 | AC | 114 ms
87,688 KB |
testcase_08 | AC | 171 ms
101,224 KB |
testcase_09 | AC | 155 ms
99,708 KB |
testcase_10 | AC | 172 ms
101,492 KB |
testcase_11 | AC | 167 ms
101,332 KB |
testcase_12 | AC | 164 ms
101,132 KB |
testcase_13 | AC | 164 ms
101,648 KB |
testcase_14 | AC | 994 ms
305,948 KB |
testcase_15 | AC | 1,153 ms
307,304 KB |
testcase_16 | AC | 905 ms
307,204 KB |
testcase_17 | AC | 906 ms
307,428 KB |
testcase_18 | AC | 906 ms
306,908 KB |
testcase_19 | AC | 921 ms
307,404 KB |
testcase_20 | AC | 976 ms
307,380 KB |
testcase_21 | AC | 976 ms
306,448 KB |
testcase_22 | AC | 1,014 ms
307,380 KB |
testcase_23 | AC | 954 ms
307,312 KB |
testcase_24 | AC | 960 ms
306,876 KB |
testcase_25 | AC | 957 ms
307,176 KB |
testcase_26 | AC | 940 ms
306,848 KB |
testcase_27 | AC | 1,039 ms
307,348 KB |
testcase_28 | AC | 985 ms
307,196 KB |
testcase_29 | AC | 1,057 ms
306,572 KB |
testcase_30 | AC | 1,016 ms
306,424 KB |
testcase_31 | AC | 915 ms
307,068 KB |
testcase_32 | AC | 946 ms
306,844 KB |
testcase_33 | AC | 1,064 ms
307,180 KB |
testcase_34 | AC | 956 ms
307,144 KB |
testcase_35 | AC | 964 ms
307,188 KB |
testcase_36 | AC | 1,035 ms
306,640 KB |
testcase_37 | AC | 986 ms
307,164 KB |
testcase_38 | AC | 957 ms
307,204 KB |
testcase_39 | AC | 967 ms
306,744 KB |
testcase_40 | AC | 965 ms
307,164 KB |
testcase_41 | AC | 967 ms
306,884 KB |
testcase_42 | AC | 969 ms
307,340 KB |
testcase_43 | AC | 989 ms
307,384 KB |
testcase_44 | AC | 998 ms
307,056 KB |
testcase_45 | AC | 956 ms
306,740 KB |
testcase_46 | AC | 968 ms
307,244 KB |
testcase_47 | AC | 968 ms
306,552 KB |
testcase_48 | AC | 967 ms
307,048 KB |
testcase_49 | AC | 891 ms
307,368 KB |
testcase_50 | AC | 962 ms
307,244 KB |
testcase_51 | AC | 953 ms
307,356 KB |
testcase_52 | AC | 982 ms
307,088 KB |
testcase_53 | AC | 975 ms
306,980 KB |
testcase_54 | AC | 975 ms
307,096 KB |
testcase_55 | AC | 961 ms
307,240 KB |
testcase_56 | AC | 972 ms
306,996 KB |
testcase_57 | AC | 971 ms
307,372 KB |
testcase_58 | AC | 974 ms
306,708 KB |
testcase_59 | AC | 907 ms
307,172 KB |
testcase_60 | AC | 974 ms
307,332 KB |
testcase_61 | AC | 974 ms
307,432 KB |
testcase_62 | AC | 1,005 ms
307,268 KB |
testcase_63 | AC | 900 ms
307,380 KB |
testcase_64 | AC | 902 ms
307,216 KB |
testcase_65 | AC | 911 ms
307,420 KB |
testcase_66 | AC | 891 ms
307,256 KB |
testcase_67 | AC | 907 ms
307,172 KB |
testcase_68 | AC | 901 ms
307,284 KB |
testcase_69 | AC | 894 ms
300,248 KB |
ソースコード
mod = 998244353 omega = pow(3,119,mod) rev_omega = pow(omega,mod-2,mod) N = 5*10**5 g1 = [1]*(N+1) # 元テーブル g2 = [1]*(N+1) #逆元テーブル inv = [1]*(N+1) #逆元テーブル計算用テーブル for i in range( 2, N + 1 ): g1[i]=( ( g1[i-1] * i ) % mod ) inv[i]=( ( -inv[mod % i] * (mod//i) ) % mod ) g2[i]=( (g2[i-1] * inv[i]) % mod ) inv[0]=0 def _ntt(f,L,reverse=False): F=[f[i] for i in range(L)] n = L.bit_length() - 1 base = omega if reverse: base = rev_omega if not n: return F size = 2**n wj = pow(base,2**22,mod) res = [0]*2**n for i in range(n,0,-1): use_omega = pow(base,2**(22+i-n),mod) res = [0]*2**n size //= 2 w = 1 for j in range(0,L//2,size): for a in range(size): res[a+j] = (F[a+2*j] + w * F[a+size+2*j]) % mod t = (w * wj) % mod res[L//2+a+j] = (F[a+2*j] + t * F[a+size+2*j]) % mod w = (w * use_omega) % mod F = res return res def ntt(f,L=0): l = len(f) if not L: L = 1<<((l-1).bit_length()) while len(f)<L: f.append(0) f=f[:L] F = _ntt(f,L) return F def intt(f,L=0): l = len(f) if not L: L = 1<<((l-1).bit_length()) while len(f)<L: f.append(0) f=f[:L] F = _ntt(f,L,reverse=True) inv = pow(L,mod-2,mod) for i in range(L): F[i] *= inv F[i] %= mod return F def convolve(f,g,limit): l = len(f)+len(g)-1 L = 1<<((l-1).bit_length()) F = ntt(f,L) G = ntt(g,L) H = [(F[i] * G[i]) % mod for i in range(L)] h = intt(H,L) return h[:limit] inv2 = pow(2,mod-2,mod) N,K = map(int,input().split()) M = list(map(int,input().split())) c = 1 for m in M: c *= m c %= mod M = [(M[i]+1)*inv2 % mod for i in range(N)] Mi = [M[N-i-1] for i in range(N)] conv = convolve(M,Mi,2*N)[N-1:] check = [conv[i]*4 % mod for i in range(N)] imos = [g2[i] for i in range(N)] for i in range(1,N): imos[i] += imos[i-1] imos[i] %= mod prod = [N-1 for i in range(K+1)] for i in range(2,K+1): prod[i] = (prod[i-1] * (N-i)) % mod prod[0] = 0 imos_prod = [prod[i] for i in range(K+1)] for i in range(1,K+1): imos_prod[i] += imos_prod[i-1] imos_prod[i] %= mod res = imos_prod[K] * conv[N-1] % mod for x in range(1,N-1): L = 1 R = min(K,N-1-x) tmp = g1[N-1-x] * (imos[N-1-x-L] - imos[N-1-x-R] + g2[N-1-x-R]) tmp2 = (imos_prod[K] - tmp) % mod res += tmp2 * conv[x] res %= mod print(res*c % mod)