結果

問題 No.856 増える演算
ユーザー vwxyzvwxyz
提出日時 2024-04-08 06:32:15
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,070 ms / 3,153 ms
コード長 3,767 bytes
コンパイル時間 1,834 ms
コンパイル使用メモリ 81,444 KB
実行使用メモリ 309,228 KB
最終ジャッジ日時 2024-04-08 06:33:35
合計ジャッジ時間 69,646 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
53,588 KB
testcase_01 AC 96 ms
76,896 KB
testcase_02 AC 44 ms
53,588 KB
testcase_03 AC 42 ms
53,844 KB
testcase_04 AC 44 ms
53,844 KB
testcase_05 AC 42 ms
53,844 KB
testcase_06 AC 41 ms
53,844 KB
testcase_07 AC 41 ms
53,844 KB
testcase_08 AC 43 ms
53,844 KB
testcase_09 AC 40 ms
53,844 KB
testcase_10 AC 43 ms
53,844 KB
testcase_11 AC 56 ms
53,844 KB
testcase_12 AC 68 ms
53,844 KB
testcase_13 AC 89 ms
76,896 KB
testcase_14 AC 87 ms
76,896 KB
testcase_15 AC 87 ms
76,896 KB
testcase_16 AC 85 ms
76,896 KB
testcase_17 AC 92 ms
76,896 KB
testcase_18 AC 90 ms
76,896 KB
testcase_19 AC 93 ms
76,896 KB
testcase_20 AC 90 ms
76,896 KB
testcase_21 AC 89 ms
76,896 KB
testcase_22 AC 100 ms
76,896 KB
testcase_23 AC 57 ms
66,936 KB
testcase_24 AC 60 ms
66,920 KB
testcase_25 AC 54 ms
64,860 KB
testcase_26 AC 41 ms
56,004 KB
testcase_27 AC 44 ms
53,844 KB
testcase_28 AC 55 ms
64,836 KB
testcase_29 AC 56 ms
64,840 KB
testcase_30 AC 55 ms
64,840 KB
testcase_31 AC 53 ms
64,860 KB
testcase_32 AC 55 ms
66,936 KB
testcase_33 AC 120 ms
77,372 KB
testcase_34 AC 126 ms
79,460 KB
testcase_35 AC 113 ms
77,660 KB
testcase_36 AC 121 ms
79,104 KB
testcase_37 AC 116 ms
78,532 KB
testcase_38 AC 98 ms
77,172 KB
testcase_39 AC 105 ms
77,160 KB
testcase_40 AC 102 ms
77,372 KB
testcase_41 AC 106 ms
77,244 KB
testcase_42 AC 125 ms
79,480 KB
testcase_43 AC 104 ms
77,372 KB
testcase_44 AC 91 ms
76,896 KB
testcase_45 AC 100 ms
77,160 KB
testcase_46 AC 103 ms
77,244 KB
testcase_47 AC 106 ms
77,372 KB
testcase_48 AC 112 ms
78,096 KB
testcase_49 AC 106 ms
77,244 KB
testcase_50 AC 115 ms
78,312 KB
testcase_51 AC 118 ms
79,108 KB
testcase_52 AC 121 ms
79,468 KB
testcase_53 AC 1,861 ms
298,028 KB
testcase_54 AC 1,751 ms
297,096 KB
testcase_55 AC 1,860 ms
297,884 KB
testcase_56 AC 1,810 ms
296,984 KB
testcase_57 AC 1,890 ms
298,160 KB
testcase_58 AC 1,836 ms
297,476 KB
testcase_59 AC 1,890 ms
299,096 KB
testcase_60 AC 1,753 ms
297,184 KB
testcase_61 AC 1,826 ms
299,200 KB
testcase_62 AC 1,832 ms
298,740 KB
testcase_63 AC 1,726 ms
309,228 KB
testcase_64 AC 1,837 ms
298,460 KB
testcase_65 AC 1,754 ms
306,076 KB
testcase_66 AC 1,825 ms
297,188 KB
testcase_67 AC 2,070 ms
297,612 KB
testcase_68 AC 1,970 ms
298,620 KB
testcase_69 AC 1,892 ms
298,584 KB
testcase_70 AC 1,864 ms
299,548 KB
testcase_71 AC 1,887 ms
298,980 KB
testcase_72 AC 1,850 ms
298,216 KB
testcase_73 AC 1,898 ms
299,728 KB
testcase_74 AC 1,936 ms
299,732 KB
testcase_75 AC 1,907 ms
299,736 KB
testcase_76 AC 1,926 ms
299,736 KB
testcase_77 AC 1,921 ms
299,728 KB
testcase_78 AC 1,899 ms
299,736 KB
testcase_79 AC 1,936 ms
299,728 KB
testcase_80 AC 1,858 ms
299,732 KB
testcase_81 AC 1,929 ms
299,744 KB
testcase_82 AC 1,858 ms
299,804 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def FFT(polynomial0,polynomial1,digit=10**5,round_to_int=True):
    assert digit==0 or round_to_int
    if len(polynomial0)*len(polynomial1)<=60:
        polynomial=[0]*(len(polynomial0)+len(polynomial1)-1)
        for i in range(len(polynomial0)):
            for j in range(len(polynomial1)):
                polynomial[i+j]+=polynomial0[i]*polynomial1[j]
        return polynomial
    def DFT(polynomial,n,inverse=False):
        if inverse:
            primitive_root=[math.cos(-i*2*math.pi/(1<<n))+math.sin(-i*2*math.pi/(1<<n))*1j for i in range(1<<n)]
        else:
            primitive_root=[math.cos(i*2*math.pi/(1<<n))+math.sin(i*2*math.pi/(1<<n))*1j for i in range(1<<n)]
        if inverse:
            for bit in range(1,n+1):
                a=1<<bit-1
                for i in range(1<<n-bit):
                    for j in range(a):
                        s=i*2*a+j
                        t=s+a
                        polynomial[s],polynomial[t]=polynomial[s]+polynomial[t]*primitive_root[j<<n-bit],polynomial[s]-polynomial[t]*primitive_root[j<<n-bit]
        else:
            for bit in range(n,0,-1):
                a=1<<bit-1
                for i in range(1<<n-bit):
                    for j in range(a):
                        s=i*2*a+j
                        t=s+a
                        polynomial[s],polynomial[t]=polynomial[s]+polynomial[t],primitive_root[j<<n-bit]*(polynomial[s]-polynomial[t])

    def FFT_(polynomial0,polynomial1,round_to_int=True):
        N0=len(polynomial0)
        N1=len(polynomial1)
        N=N0+N1-1
        n=(N-1).bit_length()
        polynomial0=polynomial0+[0]*((1<<n)-N0)
        polynomial1=polynomial1+[0]*((1<<n)-N1)
        DFT(polynomial0,n)
        DFT(polynomial1,n)
        fft=[x*y for x,y in zip(polynomial0,polynomial1)]
        DFT(fft,n,inverse=True)
        if round_to_int:
            fft=[round((fft[i]/(1<<n)).real) for i in range(N)]
        else:
            fft=[(fft[i]/(1<<n)).real for i in range(N)]
        return fft

    if digit:
        N0=len(polynomial0)
        N1=len(polynomial1)
        N=N0+N1-1
        polynomial00,polynomial01=[None]*N0,[None]*N0
        polynomial10,polynomial11=[None]*N1,[None]*N1
        for i in range(N0):
            polynomial00[i],polynomial01[i]=divmod(polynomial0[i],digit)
        for i in range(N1):
            polynomial10[i],polynomial11[i]=divmod(polynomial1[i],digit)
        polynomial=[0]*N
        for i,x in enumerate(FFT_(polynomial00,polynomial10)):
            polynomial[i]+=x*(digit**2-digit)
        for i,x in enumerate(FFT_(polynomial01,polynomial11)):
            polynomial[i]-=x*(digit-1)
        for i,x in enumerate(FFT_([x1+x2 for x1,x2 in zip(polynomial00,polynomial01)],[x1+x2 for x1,x2 in zip(polynomial10,polynomial11)])):
            polynomial[i]+=x*digit
    else:
        polynomial=FFT_(polynomial0,polynomial1,round_to_int=round_to_int)
    return polynomial

import math
import sys
#sys.set_int_max_str_digits(10**7)

N=int(input())
mod=998244353
A=list(map(int,input().split()))
max_A=max(A)
cnt=[0]*(max_A+1)
for a in A:
    cnt[a]+=1
cnt=FFT(cnt,cnt)
mod=10**9+7
M=1
prod_A=1
for a in A:
    prod_A*=a
    prod_A%=mod
for a in A:
    cnt[a*2]-=1
ans=1
for a in range(1,max_A*2+1):
    ans*=pow(a,cnt[a]//2,mod)
    ans%=mod
cumsum=[0]+A
for i in range(1,N+1):
    cumsum[i]+=cumsum[i-1]
for i in range(N):
    ans*=pow(A[i],cumsum[N]-cumsum[i+1],mod)
    ans%=mod
j=A.index(min(A))
if j:
    i=A[:j].index(min(A[:j]))
else:
    i=None
if j<N-1:
    k=j+1+A[j+1:N].index(min(A[j+1:N]))
else:
    k=None
if i==None:
    mi=(A[j]+A[k])*A[j]**A[k]
elif k==None:
    mi=(A[i]+A[j])*A[i]**A[j]
else:
    mi=min((A[j]+A[k])*A[j]**A[k],(A[i]+A[j])*A[i]**A[j])
ans*=pow(mi,mod-2,mod)
ans%=mod
print(ans)
0