結果

問題 No.2176 LRM Question 1
ユーザー Keroru
提出日時 2023-01-06 21:47:09
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 381 ms / 2,000 ms
コード長 6,081 bytes
コンパイル時間 298 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 259,072 KB
最終ジャッジ日時 2024-11-30 17:41:31
合計ジャッジ時間 8,307 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

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

import sys
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()
import bisect,string,math,time,functools,random,fractions
from bisect import*
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
import itertools
rep=range;R=range
def I():return int(input())
def LI():return [int(i) for i in input().split()]
def SLI():return sorted([int(i) for i in input().split()])
def LI_():return [int(i)-1 for i in input().split()]
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def NLI(n):return [[int(i) for i in input().split()] for i in range(n)]
def NLI_(n):return [[int(i)-1 for i in input().split()] for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)]
def RI(a=1,b=10):return random.randint(a,b)
def GI(V,E,ls=None,Directed=False,index=1):
org_inp=[];g=[[] for i in range(V)]
FromStdin=True if ls==None else False
for i in range(E):
if FromStdin:
inp=LI()
org_inp.append(inp)
else:
inp=ls[i]
if len(inp)==2:a,b=inp;c=1
else:a,b,c=inp
if index==1:a-=1;b-=1
aa=a,c,;bb=b,c,;g[a].append(bb)
if not Directed:g[b].append(aa)
return g,org_inp
def RE(E):
rt=[[]for i in range(len(E))]
for i in range(len(E)):
for nb,d in E[i]:
rt[nb]+=(i,d),
return rt
def RLE(it):
rt=[]
for i in it:
if rt and rt[-1][0]==i:rt[-1][1]+=1
else:rt+=[i,1],
return rt
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
#h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
mp=[boundary]*(w+2);found={}
for i in R(h):
s=input()
for char in search:
if char in s:
found[char]=((i+1)*(w+2)+s.index(char)+1)
mp_def[char]=mp_def[replacement_of_found]
mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
mp+=[boundary]*(w+2)
return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
rt=[0]
for i in ls:rt+=[rt[-1]+i]
return rt
def bit_combination(n,base=2):
rt=[]
for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
return rt
def gcd(x,y):
if y==0:return x
if x%y==0:return y
while x%y!=0:x,y=y,x%y
return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
if show_flg:print(*inp,end=end)
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip
    ('UDRL',FourNb));HexNb=[(-1,0),(-1,-1),(0,1),(0,-1),(1,1),(1,0)]
alp=[chr(ord('a')+i)for i in range(26)]
#sys.setrecursionlimit(10**7)
def gcj(t,*a):
print('Case #{}:'.format(t+1),*a)
def INP():
n=N=8
while True:
i=random.randint(1,n)
j=random.randint(1,n)
x=random.randint(1,n)
y=random.randint(1,n)
if i!=j and x!=y:
break
return n,i,j,x,y
def Rtest(T):
case,err=0,0
for i in range(T):
inp=INP()
#show(inp)
a1=naive(*inp)
a2=solve(*inp)
if a1!=a2:
print(inp)
print('naive',a1)
print('solve',a2)
err+=1
case+=1
print('Tested',case,'case with',err,'errors')
mo=998244353
#mo=10**9+7
show_flg=False
show_flg=True
class Comb:
def __init__(self,n=0,mo=10**9+7):
self.size=1
self.mo=mo
self.fac=[0]*self.size
self.inv=[1]*self.size
self.fac[0]=1
self.extend(n+1)
return
def extend(self,mx):
x=max(2*self.size,mx)-self.size+1
self.fac+=[0]*x
self.inv+=[1]*x
for i in range(self.size,self.size+x):
self.fac[i]=i*self.fac[i-1]%self.mo
self.inv[-1]*=i
self.inv[-1]%=self.mo
self.inv[-1]=pow(self.inv[-1],self.mo-2,self.mo)
self.inv[-1]*=self.inv[self.size-1]
self.inv[-1]%=self.mo
for i in range(x+self.size-1,self.size,-1):
self.inv[i-1]=self.inv[i]*(i)%self.mo
self.size+=x
return
def fact(self,n):
if n>=self.size:
self.extend(n)
return self.fac[n]
def invf(self,n):
if n>=self.size:
self.extend(n)
return self.inv[n]
def comb(self,x,y):
if y<0 or y>x:
return 0
if x>=self.size:
self.extend(x)
return self.fac[x]*self.inv[x-y]*self.inv[y]%self.mo
def rcomb(self,x,y):
if y<0 or y>x:
return 0
if x>=self.size:
self.extend(x)
return self.inv[x]*self.fac[x-y]*self.fac[y]%self.mo
def cat(self,x):
if x<0:
return 0
if 2*x>self.size:
self.extend(x)
return self.fac[2*x]*self.inv[x]*self.inv[x+1]%self.mo
def Golf_Comb():
M=10**9+7
F=[1]
for i in range(n):F+=F[i]*-~i%M,
C=lambda A,B:F[A]*pow(F[A-B]*F[B],M-2,M)%M
return C(x,y)
def Golf_Comb_2():
F=1,
I=1,
for i in range(K):F+=F[i]*-~i%M,;I+=pow(F[-1],M-2,M),
return F[x]*I[x-y]*I[y]%M
def Golf_Comb_3():
F=1,
for i in range(n):F+=F[i]*-~i%M,
C=lambda x,y:F[x]*pow(F[x-y]*F[y],M-2,M)if x>=y>=0else 0
def Golf_Comb_4():
n,m,*I=map(int,input().split())
F=[1]
for i in range(n):F+=F[i]*-~i%M,;I+=pow(F[i],M-2,M),
ans=0
l,r,m=LI()
mo=m
cm=Comb(1,mo)
r=min(r,10**6+10)
x=cm.comb(r+10,2)
a=cm.fac
ac=[1]
t=1
f=[]
for i in a:
t=t*i%mo
f+=t,
ac+=(ac[-1]+t)%mo,
if l>m:
ans=0
else:
ans=ac[r+1]-ac[l]
print(ans%mo)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0