結果

問題 No.1549 [Cherry 2nd Tune] BANning Tuple
ユーザー convexineq
提出日時 2021-06-11 22:33:07
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,191 ms / 4,000 ms
コード長 2,627 bytes
コンパイル時間 463 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 111,116 KB
最終ジャッジ日時 2024-12-15 00:46:15
合計ジャッジ時間 16,205 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

ROOT = 3
MOD = 998244353
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]
def fpsinv(f,N):
    g = [pow(f[0],MOD-2,MOD)]
    n = 1
    while n <= N:
        ng = [2*i for i in g]+[0]*n
        fgg = polymul(polymul(g,g),f)
        for i in range(min(len(fgg),2*n)):
            ng[i] -= fgg[i]
            ng[i] %= MOD
        n *= 2
        g = ng
    return g[:N+1]
    
def polymul(a,b):
    return convolution(a[:],b[:])
def inv(x): return pow(x,MOD-2,MOD)
n,Q = map(int,input().split())
n %= MOD
M = 3001
p = [1]
for i in range(M):
    v = p[-1]*(n+i+1)%MOD
    p.append(v*inv(i+1))
dlst = {}
ddelta = {}
for _ in range(Q):
    k,a,b,s,t = map(int,input().split())
    if k not in ddelta:
        delta = 0
        lst = [1]*M
        for i in range(1,M)[::-1]:
            p[i] -= p[i-1]
            p[i] %= MOD
    else:
        delta,lst = ddelta[k],dlst[k]
        if delta != M:
            p = polymul(p,fpsinv(lst[delta:]+[0]*delta,M))[:M]
    
    for i in range(a,b+1):
        lst[i] = 0
    ndelta = 0
    for i in range(delta,M):
        if lst[i] == 0:
            ndelta += 1
        else:
            break
    
    delta += ndelta
    p = ([0]*ndelta + polymul(p,lst[delta:]))[:M]
    ans = p[t] - (p[s-1] if s else 0)
    print(ans%MOD)
    ddelta[k] = delta
    dlst[k] = lst
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0