結果
問題 | No.2791 Beginner Contest |
ユーザー |
|
提出日時 | 2024-06-21 22:23:14 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 246 ms / 2,000 ms |
コード長 | 4,431 bytes |
コンパイル時間 | 341 ms |
コンパイル使用メモリ | 82,252 KB |
実行使用メモリ | 81,972 KB |
最終ジャッジ日時 | 2024-06-21 22:23:18 |
合計ジャッジ時間 | 3,668 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 17 |
ソースコード
class lazy_segtree():def update(self,k):self.d[k]=self.op(self.d[2*k],self.d[2*k+1])def all_apply(self,k,f):self.d[k]=self.mapping(f,self.d[k])if (k<self.size):self.lz[k]=self.composition(f,self.lz[k])def push(self,k):self.all_apply(2*k,self.lz[k])self.all_apply(2*k+1,self.lz[k])self.lz[k]=self.identitydef __init__(self,V,OP,E,MAPPING,COMPOSITION,ID):self.n=len(V)self.log=(self.n-1).bit_length()self.size=1<<self.logself.d=[E for i in range(2*self.size)]self.lz=[ID for i in range(self.size)]self.e=Eself.op=OPself.mapping=MAPPINGself.composition=COMPOSITIONself.identity=IDfor i in range(self.n):self.d[self.size+i]=V[i]for i in range(self.size-1,0,-1):self.update(i)def set(self,p,x):assert 0<=p and p<self.np+=self.sizefor i in range(self.log,0,-1):self.push(p>>i)self.d[p]=xfor i in range(1,self.log+1):self.update(p>>i)def get(self,p):assert 0<=p and p<self.np+=self.sizefor i in range(self.log,0,-1):self.push(p>>i)return self.d[p]def prod(self,l,r):assert 0<=l and l<=r and r<=self.nif l==r:return self.el+=self.sizer+=self.sizefor i in range(self.log,0,-1):if (((l>>i)<<i)!=l):self.push(l>>i)if (((r>>i)<<i)!=r):self.push(r>>i)sml,smr=self.e,self.ewhile(l<r):if l&1:sml=self.op(sml,self.d[l])l+=1if r&1:r-=1smr=self.op(self.d[r],smr)l>>=1r>>=1return self.op(sml,smr)def all_prod(self):return self.d[1]def apply_point(self,p,f):assert 0<=p and p<self.np+=self.sizefor i in range(self.log,0,-1):self.push(p>>i)self.d[p]=self.mapping(f,self.d[p])for i in range(1,self.log+1):self.update(p>>i)def apply(self,l,r,f):assert 0<=l and l<=r and r<=self.nif l==r:returnl+=self.sizer+=self.sizefor i in range(self.log,0,-1):if (((l>>i)<<i)!=l):self.push(l>>i)if (((r>>i)<<i)!=r):self.push((r-1)>>i)l2,r2=l,rwhile(l<r):if (l&1):self.all_apply(l,f)l+=1if (r&1):r-=1self.all_apply(r,f)l>>=1r>>=1l,r=l2,r2for i in range(1,self.log+1):if (((l>>i)<<i)!=l):self.update(l>>i)if (((r>>i)<<i)!=r):self.update((r-1)>>i)def max_right(self,l,g):assert 0<=l and l<=self.nassert g(self.e)if l==self.n:return self.nl+=self.sizefor i in range(self.log,0,-1):self.push(l>>i)sm=self.ewhile(1):while(l%2==0):l>>=1if not(g(self.op(sm,self.d[l]))):while(l<self.size):self.push(l)l=(2*l)if (g(self.op(sm,self.d[l]))):sm=self.op(sm,self.d[l])l+=1return l-self.sizesm=self.op(sm,self.d[l])l+=1if (l&-l)==l:breakreturn self.ndef min_left(self,r,g):assert (0<=r and r<=self.n)assert g(self.e)if r==0:return 0r+=self.sizefor i in range(self.log,0,-1):self.push((r-1)>>i)sm=self.ewhile(1):r-=1while(r>1 and (r%2)):r>>=1if not(g(self.op(self.d[r],sm))):while(r<self.size):self.push(r)r=(2*r+1)if g(self.op(self.d[r],sm)):sm=self.op(self.d[r],sm)r-=1return r+1-self.sizesm=self.op(self.d[r],sm)if (r&-r)==r:breakreturn 0mod=998244353n,k=map(int,input().split())L=[0]*(n+1)L[0]=1def operate(a,b):return (a+b)%moddef mapping(f,x):return f+xdef composition(f,g):return f+ge=0identity=0seg=lazy_segtree(L,operate,e,mapping,composition,identity)for l in range(n):f=seg.get(l)f%=modif l+k<=n:seg.apply(l+k,n+1,f)print(seg.all_prod()%mod)