結果
問題 | No.2697 Range LIS Query |
ユーザー |
|
提出日時 | 2024-03-22 22:18:30 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 8,606 ms / 10,000 ms |
コード長 | 6,596 bytes |
コンパイル時間 | 209 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 279,208 KB |
最終ジャッジ日時 | 2024-09-30 11:48:27 |
合計ジャッジ時間 | 78,624 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 15 |
ソースコード
import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random#sys.setrecursionlimit(10**9)#sys.set_int_max_str_digits(0)input = sys.stdin.readline#https://github.com/shakayami/ACL-for-python/blob/master/lazysegtree.pyclass 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 = 998244353#区間加算・区間最小値取得 lst = lazy_segtree([],min,10**18,operator.add,operator.add,0)#区間加算・区間最大値取得 lst = lazy_segtree([],max,-10**18,operator.add,operator.add,0)#区間加算・区間和取得 lst = lazy_segtree([(alist[i],1) for i in range(n)],lambda x,y:((x[0]+y[0])%mod,x[1]+y[1]),(0,0),lambda x,y:((y[0]+x*y[1])%mod,y[1]),operator.add,0)#区間変更・区間最小値取得 lst = lazy_segtree([],min,10**18,lambda x,y:y if x == 10**18 else x,lambda x,y:y if x == 10**18 else x,10**18)#区間変更・区間最大値取得 lst = lazy_segtree([],max,-10**18,lambda x,y:y if x == -10**18 else x,lambda x,y:y if x == -10**18 else x,-10**18)#区間変更・区間和取得 lst = lazy_segtree([(alist[i],1) for i in range(n)],lambda x,y:((x[0]+y[0])%mod,x[1]+y[1]),(0,0),lambda x,y:(y[1]*x,y[1]) if x!= 10**18 else y,lambda x,y:y if x == 10**18 else x,10**18)def mapping(x,y):if x == 10**18:return yz = [0 for i in range(17)]z[-1] = y[-1]x -= 1z[x*4+x] = z[-1]return tuple(z)#yが作用してからxが作用するdef composition(x,y):returndef op(x,y):z = [max(x[i],y[i]) for i in range(16)]z.append(x[-1]+y[-1])#print(x,y,z)for i in range(4):for j in range(i,4):for k in range(j,4):for l in range(k,4):if x[i*4+j] == 0 or y[k*4+l] == 0:continuez[i*4+l] = max(z[i*4+l],x[i*4+j] + y[k*4+l])#z[-1] = x[-1] + y[-1]#print(x,y,z)return tuple(z)#n = int(input())#alist = list(map(int,input().split()))#alist = []#s = input()n = int(input())a = list(map(int,input().split()))v = []for i in range(n):z = [0 for j in range(17)]z[-1] = 1a[i] -= 1z[a[i]*4+a[i]] = 1v.append(tuple(z))e = tuple([0 for i in range(17)])st = lazy_segtree(v,op,e,mapping,lambda x,y:y if x == 10**18 else x,10**18)q = int(input())#print(st.prod(0,2))for i in range(q):query = list(map(int,input().split()))if query[0] == 1:t,l,r = queryl -= 1r -= 1print(max(st.prod(l,r+1)[:16]))else:t,l,r,x = queryl -= 1r -= 1st.apply(l,r+1,x)