結果
問題 | No.1705 Mode of long array |
ユーザー |
![]() |
提出日時 | 2021-10-08 23:21:51 |
言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
結果 |
AC
|
実行時間 | 1,564 ms / 3,000 ms |
コード長 | 4,067 bytes |
コンパイル時間 | 188 ms |
コンパイル使用メモリ | 13,184 KB |
実行使用メモリ | 28,936 KB |
最終ジャッジ日時 | 2024-07-23 07:20:14 |
合計ジャッジ時間 | 46,001 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 51 |
ソースコード
import sysreadline=sys.stdin.readlineclass Segment_Tree:def __init__(self,N,f,e,lst=None):self.f=fself.e=eself.N=Nif lst==None:self.segment_tree=[self.e]*2*self.Nelse:assert len(lst)<=self.Nself.segment_tree=[self.e]*self.N+[x for x in lst]+[self.e]*(N-len(lst))for i in range(self.N-1,0,-1):self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])def __getitem__(self,i):if type(i)==int:if -self.N<=i<0:return self.segment_tree[i+self.N*2]elif 0<=i<self.N:return self.segment_tree[i+self.N]else:raise IndexError('list index out of range')else:a,b,c=i.start,i.stop,i.stepif a==None or a<-self.N:a=self.Nelif self.N<=a:a=self.N*2elif a<0:a+=self.N*2else:a+=self.Nif b==None or self.N<=b:b=self.N*2elif b<-self.N:b=self.Nelif b<0:b+=self.N*2else:b+=self.Nreturn self.segment_tree[slice(a,b,c)]def __setitem__(self,i,x):if -self.N<=i<0:i+=self.N*2elif 0<=i<self.N:i+=self.Nelse:raise IndexError('list index out of range')self.segment_tree[i]=xwhile i>1:i>>= 1self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])def Build(self,lst):for i,x in enumerate(lst,self.N):self.segment_tree[i]=xfor i in range(self.N-1,0,-1):self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])def Fold(self,L=None,R=None):if L==None or L<-self.N:L=self.Nelif self.N<=L:L=self.N*2elif L<0:L+=self.N*2else:L+=self.Nif R==None or self.N<=R:R=self.N*2elif R<-self.N:R=self.Nelif R<0:R+=self.N*2else:R+=self.NvL=self.evR=self.ewhile L<R:if L&1:vL=self.f(vL,self.segment_tree[L])L+=1if R&1:R-=1vR=self.f(self.segment_tree[R],vR)L>>=1R>>=1return self.f(vL,vR)def Fold_Index(self,L=None,R=None):if L==None or L<-self.N:L=self.Nelif self.N<=L:L=self.N*2elif L<0:L+=self.N*2else:L+=self.Nif R==None or self.N<=R:R=self.N*2elif R<-self.N:R=self.Nelif R<0:R+=self.N*2else:R+=self.Nif L==R:return Nonex=self.Fold(L-self.N,R-self.N)while L<R:if L&1:if self.segment_tree[L]==x:i=LbreakL+=1if R&1:R-=1if self.segment_tree[R]==x:i=RbreakL>>=1R>>=1while i<self.N:if self.segment_tree[i]==self.segment_tree[i<<1]:i<<=1else:i<<=1i|=1i-=self.Nreturn idef __str__(self):return '['+', '.join(map(str,self.segment_tree[self.N:]))+']'N,M=map(int,readline().split())A=list(map(int,readline().split()))lst=[0]+[i+1+(A[i]<<20) for i in range(M)]Q=int(readline())inf=1<<60ST=Segment_Tree(M+1,max,-inf,lst=lst)for _ in range(Q):T,X,Y=map(int,readline().split())if T==1:ST[X]+=Y<<20elif T==2:ST[X]-=Y<<20else:ans=ST.Fold_Index()print(ans)