結果
| 問題 | No.1011 Infinite Stairs |
| ユーザー |
 Keroru
|
| 提出日時 | 2020-05-11 21:29:10 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 1,022 ms / 2,000 ms |
| コード長 | 7,314 bytes |
| コンパイル時間 | 251 ms |
| コンパイル使用メモリ | 82,236 KB |
| 実行使用メモリ | 235,504 KB |
| 最終ジャッジ日時 | 2024-07-17 12:07:42 |
| 合計ジャッジ時間 | 9,020 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 24 |
ソースコード
import sys,bisect,string,math,time,functools,random,fractionsfrom heapq import heappush,heappop,heapifyfrom collections import deque,defaultdict,Counterfrom itertools import permutations,combinations,groupbydef Golf():*a,=map(int,open(0))def I():return int(input())def S_():return input()def IS():return input().split()def LS():return [i for i in 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 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 range(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 bit_combination(n,base=2):rt=[]for tb in range(base**n):s=[tb//(base**bt)%base for bt in range(n)];rt+=[s]return rtdef gcd(x,y):if x%y==0:return ywhile x%y!=0:x,y=y,x%yreturn ydef show(*inp,end='\n'):if show_flg:print(*inp,end=end)YN=['YES','NO'];Yn=['Yes','No']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('EWNS',FourNb))l_alp=string.ascii_lowercase#sys.setrecursionlimit(10**7)input=lambda: sys.stdin.readline().rstrip()class Tree:def __init__(self,inp_size=None,ls=None,init=True,index=0):self.LCA_init_stat=Falseself.ETtable=[]if init:if ls==None:self.stdin(inp_size,index=index)else:self.size=len(ls)+1self.edges,_=GI(self.size,self.size-1,ls,index=index)returndef stdin(self,inp_size=None,index=1):if inp_size==None:self.size=int(input())else:self.size=inp_sizeself.edges,_=GI(self.size,self.size-1,index=index)returndef listin(self,ls,index=0):self.size=len(ls)+1self.edges,_=GI(self.size,self.size-1,ls,index=index)returndef __str__(self):return str(self.edges)def dfs(self,x,func=lambda prv,nx,dist:prv+dist,root_v=0):q=deque()q.append(x)v=[-1]*self.sizev[x]=root_vwhile q:c=q.pop()for nb,d in self.edges[c]:if v[nb]==-1:q.append(nb)v[nb]=func(v[c],nb,d)return vdef EulerTour(self,x):q=deque()q.append(x)self.depth=[None]*self.sizeself.depth[x]=0self.ETtable=[]self.ETdepth=[]self.ETin=[-1]*self.sizeself.ETout=[-1]*self.sizecnt=0while q:c=q.pop()if c<0:ce=~celse:ce=cfor nb,d in self.edges[ce]:if self.depth[nb]==None:q.append(~ce)q.append(nb)self.depth[nb]=self.depth[ce]+1self.ETtable.append(ce)self.ETdepth.append(self.depth[ce])if self.ETin[ce]==-1:self.ETin[ce]=cntelse:self.ETout[ce]=cntcnt+=1returndef LCA_init(self,root):self.EulerTour(root)self.st=SparseTable(self.ETdepth,init_func=min,init_idl=inf)self.LCA_init_stat=Truereturndef LCA(self,root,x,y):if self.LCA_init_stat==False:self.LCA_init(root)xin,xout=self.ETin[x],self.ETout[x]yin,yout=self.ETin[y],self.ETout[y]a=min(xin,yin)b=max(xout,yout,xin,yin)id_of_min_dep_in_et=self.st.query_id(a,b+1)return self.ETtable[id_of_min_dep_in_et]class SparseTable: # O(N log N) for init, O(1) for query(l,r)def __init__(self,ls,init_func=min,init_idl=float('inf')):self.func=init_funcself.idl=init_idlself.size=len(ls)self.N0=self.size.bit_length()self.table=[ls[:]]self.index=[list(range(self.size))]self.lg=[0]*(self.size+1)for i in range(2,self.size+1):self.lg[i]=self.lg[i>>1]+1for i in range(self.N0):tmp=[self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) for j in range(self.size)]tmp_id=[self.index[i][j] if self.table[i][j]==self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) else self.index[i][min(j+(1<<i),self.size-1)] for j in range(self.size)]self.table+=[tmp]self.index+=[tmp_id]# return func of [l,r)def query(self,l,r):if r>self.size:r=self.size#N=(r-l).bit_length()-1N=self.lg[r-l]return self.func(self.table[N][l],self.table[N][r-(1<<N)])# return index of which val[i] = func of v among [l,r)def query_id(self,l,r):if r>self.size:r=self.size#N=(r-l).bit_length()-1N=self.lg[r-l]a,b=self.index[N][l],self.index[N][r-(1<<N)]if self.table[0][a]==self.func(self.table[N][l],self.table[N][r-(1<<N)]):b=areturn bdef __str__(self):return str(self.table[0])def print(self):for i in self.table:print(*i)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)for 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]%moshow_flg=Falseshow_flg=Trueans=0n,d,k=LI()dp=[0]*(k+1)dp[0]=1for i in range(1,n+1):nx=[0]*(k+1)ad=[0]for y in dp:ad+=[ad[-1]+y]for j in range(i,d*i+1):if j>k:continuenx[j]+=ad[j]-ad[max(0,j-d)]nx[j]%=modp=nxprint(dp[k])