結果
問題 | No.1191 数え上げを愛したい(数列編) |
ユーザー | Keroru |
提出日時 | 2020-08-24 19:00:56 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,940 bytes |
コンパイル時間 | 378 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 110,360 KB |
最終ジャッジ日時 | 2024-11-06 10:35:31 |
合計ジャッジ時間 | 7,052 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 210 ms
108,420 KB |
testcase_16 | AC | 210 ms
108,748 KB |
testcase_17 | AC | 209 ms
108,628 KB |
testcase_18 | AC | 210 ms
108,404 KB |
testcase_19 | AC | 215 ms
108,780 KB |
testcase_20 | AC | 215 ms
108,552 KB |
testcase_21 | AC | 212 ms
108,528 KB |
testcase_22 | WA | - |
testcase_23 | AC | 212 ms
108,576 KB |
testcase_24 | AC | 213 ms
108,596 KB |
testcase_25 | AC | 212 ms
108,612 KB |
ソースコード
import sys,bisect,string,math,time,functools,random,fractionsfrom heapq import heappush,heappop,heapifyfrom collections import deque,defaultdict,Counterfrom itertools import permutations,combinations,groupbyrep=range;R=rangedef Golf():n,*t=map(int,open(0).read().split())def I():return int(input())def S_():return input()def IS():return input().split()def LS():return [i for i in input().split()]def MI():return map(int,input().split())def LI():return [int(i) for i in input().split()]def LI_():return [int(i)-1 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 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 RA():return map(int,open(0).read().split())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 Rtest(T):case,err=0,0for i in range(T):inp=INP()a1,ls=naive(*inp)a2=solve(*inp)if a1!=a2:print((a1,a2),inp)err+=1case+=1print('Tested',case,'case with',err,'errors')def GI(V,E,ls=None,Directed=False,index=1):org_inp=[];g=[[] for i in range(V)]FromStdin=True if ls==None else Falsefor i in range(E):if FromStdin:inp=LI()org_inp.append(inp)else:inp=ls[i]if len(inp)==2:a,b=inp;c=1else:a,b,c=inpif index==1:a-=1;b-=1aa=(a,c);bb=(b,c);g[a].append(bb)if not Directed:g[b].append(aa)return g,org_inpdef 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 usagemp=[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,founddef TI(n):return GI(n,n-1)def accum(ls):rt=[0]for i in ls:rt+=[rt[-1]+i]return rtdef 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 rtdef gcd(x,y):if y==0:return xif x%y==0:return ywhile x%y!=0:x,y=y,x%yreturn ydef 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)mo=10**9+7inf=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('LRUD',FourNb))l_alp=string.ascii_lowercase#sys.setrecursionlimit(10**9)read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()class Comb:def __init__(self,n,mo=10**9+7):self.fac=[0]*(n+1)self.inv=[1]*(n+1)self.fac[0]=1self.fact(n)self.mo=mofor i in range(1,n+1):self.fac[i]=i*self.fac[i-1]%moself.inv[n]*=iself.inv[n]%=moself.inv[n]=pow(self.inv[n],mo-2,mo)for i in range(1,n):self.inv[n-i]=self.inv[n-i+1]*(n-i+1)%moreturndef fact(self,n):return self.fac[n]def invf(self,n):return self.inv[n]def comb(self,x,y):if y<0 or y>x:return 0return self.fac[x]*self.inv[x-y]*self.inv[y]%self.moshow_flg=Falseshow_flg=Trueans=0n,m,a,b=LI()cm=Comb(10**6,mo=998244353)if b<a*(n-1):print(0)exit()for k in range(m):N=min(b,m-1)-k - a*(n-1)if N>=0:ans+=cm.comb(N+n,n)print(ans*cm.fac[n]%cm.mo)