結果
問題 | No.230 Splarraay スプラレェーイ |
ユーザー | mymelochan |
提出日時 | 2024-01-10 21:51:34 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,079 ms / 5,000 ms |
コード長 | 4,872 bytes |
コンパイル時間 | 164 ms |
コンパイル使用メモリ | 82,436 KB |
実行使用メモリ | 185,936 KB |
最終ジャッジ日時 | 2024-09-27 20:21:52 |
合計ジャッジ時間 | 9,067 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
54,200 KB |
testcase_01 | AC | 35 ms
54,224 KB |
testcase_02 | AC | 35 ms
55,436 KB |
testcase_03 | AC | 34 ms
54,324 KB |
testcase_04 | AC | 34 ms
54,740 KB |
testcase_05 | AC | 137 ms
78,656 KB |
testcase_06 | AC | 357 ms
84,888 KB |
testcase_07 | AC | 126 ms
77,692 KB |
testcase_08 | AC | 222 ms
79,992 KB |
testcase_09 | AC | 648 ms
124,652 KB |
testcase_10 | AC | 511 ms
92,368 KB |
testcase_11 | AC | 515 ms
104,708 KB |
testcase_12 | AC | 608 ms
124,820 KB |
testcase_13 | AC | 382 ms
86,344 KB |
testcase_14 | AC | 219 ms
104,844 KB |
testcase_15 | AC | 633 ms
109,944 KB |
testcase_16 | AC | 682 ms
145,376 KB |
testcase_17 | AC | 1,079 ms
185,936 KB |
testcase_18 | AC | 422 ms
122,240 KB |
testcase_19 | AC | 767 ms
154,384 KB |
ソースコード
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.identity def __init__(self,V,OP,E,MAPPING,COMPOSITION,ID): self.n=len(V) self.log=(self.n-1).bit_length() self.size=1<<self.log self.d=[E for i in range(2*self.size)] self.lz=[ID for i in range(self.size)] self.e=E self.op=OP self.mapping=MAPPING self.composition=COMPOSITION self.identity=ID for 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.n p+=self.size for i in range(self.log,0,-1):self.push(p>>i) self.d[p]=x for i in range(1,self.log+1):self.update(p>>i) def get(self,p): assert 0<=p and p<self.n p+=self.size for 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.n if l==r:return self.e l+=self.size r+=self.size for 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.e while(l<r): if l&1: sml=self.op(sml,self.d[l]) l+=1 if r&1: r-=1 smr=self.op(self.d[r],smr) l>>=1 r>>=1 return self.op(sml,smr) def all_prod(self):return self.d[1] def apply_point(self,p,f): assert 0<=p and p<self.n p+=self.size for 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.n if l==r:return l+=self.size r+=self.size for 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,r while(l<r): if (l&1): self.all_apply(l,f) l+=1 if (r&1): r-=1 self.all_apply(r,f) l>>=1 r>>=1 l,r=l2,r2 for 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.n assert g(self.e) if l==self.n:return self.n l+=self.size for i in range(self.log,0,-1):self.push(l>>i) sm=self.e while(1): while(l%2==0):l>>=1 if 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+=1 return l-self.size sm=self.op(sm,self.d[l]) l+=1 if (l&-l)==l:break return self.n def min_left(self,r,g): assert (0<=r and r<=self.n) assert g(self.e) if r==0:return 0 r+=self.size for i in range(self.log,0,-1):self.push((r-1)>>i) sm=self.e while(1): r-=1 while(r>1 and (r%2)):r>>=1 if 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-=1 return r+1-self.size sm=self.op(self.d[r],sm) if (r&-r)==r:break return 0 def operate(a,b): return (a[0]+b[0],a[1]+b[1],a[2]+b[2]) def mapping(f,x): if f==0: return x elif f==1: return (x[2],0,x[2]) else: return (0,x[2],x[2]) def composition(f,g): if f == 0: return g return f import sys ipt = sys.stdin.readline inf = 1<<30 def iin(): return int(ipt()) def lmin(): return list(map(int,ipt().split())) N = iin() Q = iin() query = [lmin() for _ in range(Q)] sgt = lazy_segtree([(0,0,1)]*N,operate,(0,0,1),mapping,composition,0) ans = [0,0] for f,l,r in query: if f == 0: t = sgt.prod(l,r+1) if t[0] < t[1]: ans[1] += t[1] elif t[0] > t[1]: ans[0] += t[0] else: sgt.apply(l,r+1,f) t = sgt.all_prod() ans[0] += t[0] ans[1] += t[1] print(*ans)