結果

問題 No.2512 Mountain Sequences
ユーザー kemuniku
提出日時 2023-09-06 23:44:54
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,347 ms / 3,000 ms
コード長 1,774 bytes
コンパイル時間 223 ms
コンパイル使用メモリ 81,920 KB
実行使用メモリ 106,024 KB
最終ジャッジ日時 2024-06-24 18:24:45
合計ジャッジ時間 24,532 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

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

import io,os,sys
#https://recruit.gmo.jp/engineer/jisedai/blog/python_standard_io_with_bytesio/
buf = io.BytesIO()
def main():
max_K = 5*10**5
fact =[-1] * (max_K+1) #MOD
inv =[-1] * (max_K+1) #MOD
fact_inv=[-1] * (max_K+1) #MOD
fact[0]=fact[1]=1
inv[1] = 1
fact_inv[0]=fact_inv[1] = 1
for i in range(2,max_K+1):
fact[i] = (fact[i-1]*i)%998244353
inv[i] = (-inv[998244353%i]*(998244353//i))%998244353
fact_inv[i] = (fact_inv[i-1]*inv[i])%998244353
def c(n,r):
if n < 0 or r < 0 or r > n:
return 0
return (fact[n]*fact_inv[r])%998244353*fact_inv[n-r]%998244353
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
T = int(input())
block = 972
Qli = [[] for i in range(200001//block+1)]
for i in range(T):
l,r = map(int,input().split())
Qli[l//block].append(r*(200001)*(200001)+l*(200001)+i)
l = 0
r = 0
ans = 0
answers = [0]*T
f = 0
f2 = fact_inv[2]
for li in Qli:
if len(li)==0:
continue
for x in sorted(li,reverse = f):
R = x//((200001)*(200001))
L = x//(200001)-R*(200001)
i = x%(200001)
while l > L:
l -= 1
ans =(c(2*r, l+1) - 2*ans)%998244353
while l < L:
ans = ((c(2*r, l+1) - ans) * fact_inv[2])%998244353
l += 1
while r > R:
ans =( ans - c(2*r-2, l-1))%998244353
r -= 1
while r < R:
r += 1
ans = (ans + c(2*r-2, l-1))%998244353
answers[i] = ans
f^=1
print(*answers,sep="\n")
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0