結果

問題 No.2080 Simple Nim Query
ユーザー 👑 p-adicp-adic
提出日時 2024-09-07 11:36:07
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,734 ms / 3,000 ms
コード長 4,383 bytes
コンパイル時間 479 ms
コンパイル使用メモリ 82,520 KB
実行使用メモリ 105,828 KB
最終ジャッジ日時 2024-09-07 11:36:28
合計ジャッジ時間 10,844 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
53,920 KB
testcase_01 AC 41 ms
54,288 KB
testcase_02 AC 40 ms
55,444 KB
testcase_03 AC 820 ms
78,696 KB
testcase_04 AC 657 ms
77,760 KB
testcase_05 AC 746 ms
102,232 KB
testcase_06 AC 1,506 ms
105,248 KB
testcase_07 AC 1,522 ms
105,356 KB
testcase_08 AC 1,044 ms
105,828 KB
testcase_09 AC 1,006 ms
105,244 KB
testcase_10 AC 1,734 ms
105,700 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def rec_str(a):return"".join(["[",", ".join(rec_str(x)for x in a),"]"])if isinstance(a,list)else str(a)
class BIT:
	def __init__(self,x):
		if isinstance(x,int):
			self.N=x
			self.F=[0]*(x+1)
		else:
			self.N=len(x)
			self.F=[0]*(self.N+1)
			for j in R(1,self.N+1):
				i=j-1
				self.F[j]=x[i]
				k=j-(j&-j)
				while i>k:
					self.F[j]+=self.F[i]
					i-=i&-i
	def copy(self):
		a=__class__([])
		a.N=__self__.N
		a.F=__self__.F[:]
		return a
	def Add(self,i,u):
		i+=1
		while i<=self.N:
			self.F[i]+=u
			i+=i&-i
	def Set(self,i,u):self.Add(i,u-self.Get(i))
	def Get(self,i):return self.IntervalSum(i,i)
	def InitialSegmentSum(self,r):
		assert(r>-2)
		a=0
		i=min(r+1,self.N)
		while i:
			a+=self.F[i]
			i-=i&-i
		return a
	def IntervalSum(self,l,r):return self.InitialSegmentSum(r)-self.InitialSegmentSum(l-1)
	def list(self):return[self.Get(i)for i in R(self.N)]
	def __str__(self):return rec_str(self.list())
	def Search(self,u):#Computing minimum of j such that InitialSegmentSum(j)>=u or j==N
		j=s=n=0
		p=1<<17 #131072
		while p:
			k=j|p
			p>>=1
			if k<=self.N:
				n+=self.F[k]
				if n<u:s,j=n,k
				else:n=s
		return j

class BoundedLineMultiSubset:
	def __init__(self,lbound,ubound):
		assert(lbound<=ubound+1)
		self.lbound=lbound
		self.ubound=ubound
		self.bit=BIT(ubound-lbound+1)
	def copy(self):
		a=__class__([])
		a.lbound=self.lbound
		a.ubound=self.ubound
		a.bit=self.bit.copy()
		return a
	def insert(self,i,c=1):assert(self.lbound<=i<=self.ubound);self.bit.Add(i-self.lbound,c)
	def erase(self,i,c=1):self.bit.Add(i-self.lbound,-c)
	def EraseAll(self,i):self.bit.Set(i-self.lbound,0)
	def count(self,i):return self.bit.Get(i-self.lbound)if self.lbound<=i<=self.ubound else 0
	def find(self,i):return self.count(i)>0
	def InitialSegmentCount(self,i_final):return self.bit.InitialSegmentSum(i_final-self.lbound)
	def IntervalCount(self,i_start,i_final):return self.bit.IntervalSum(i_start-self.lbound,i_final-self.lbound)

	#VVV Supported if multiplicities are non-negative
	def empty(self):return self.InitialSegmentCount(self.ubound)<1
	def MaximumLeq(self,i,k=0):#Returning lbound-1 if not exists
		num=self.InitialSegmentCount(i)-k
		i-=self.lbound
		def f(sum,j):return i<=j or num<=sum
		a=self.Search(f)+self.lbound
		return a if num>=0 and self.find(a)else self.lbound-1
	def MaximumLt(self,i,k=0):return self.MaximumLeq(i-1,k)
	def MinimumGeq(self,i,k=0):return self.MinimumGt(i-1,k)
	def MinimumGt(self,i,k=0):#Returning ubound+1 if not exists
		num=self.InitialSegmentCount(i)+k
		i-=self.lbound
		def f(sum,j):return i<j and num<sum
		return self.Search(f)+self.lbound
	def Maximum(self,k=0):return self.MaximumLeq(self.ubound,k)
	def Minimum(self,k=0):return self.MinimumGeq(self.lbound,k)
	def RightEndPointOf(self,i,b=False):
		if not b and not self.find(i):return i-1
		d=i-self.lbound
		c=d-self.InitialSegmentCount(i)
		def f(sum,j):return d<=j and sum+c<j
		return self.Search(f)+self.lbound-1
	def LeftEndPointOf(self,i,b=False):
		if not b and not self.find(i):return i+1
		d=i-self.lbound
		c=d-self.InitialSegmentCount(i)
		def f(sum,j):return d<=j or(self.find(j)and sum+c==j)
		return self.Search(f)+self.lbound
	def ConnectedComponentOf(self,i,b=False):
		if not b:b=self.find(i)
		return[self.LeftEndPointOf(i,b),self.RightEndPointOf(i,b)]
	def GetConnectedComponent(self):
		a=[]
		l=self.Minimum()
		while l<=self.ubound:
			r=self.RightEndPointOf(l,True)
			a+=[[l,r]]
			l=self.MinimumGt(r)
		return a
	#AAA Supported if multiplicities are non-negative

	def __str__(self):
		s=[]
		for i in R(self.lbound,self.ubound+1):
			c=self.count(i)
			if c==1:s+=[str(i)]
			elif c>0:s+=[str(i)+'x'+str(c)]
			elif c<0:s+=[str(i)+"x("+str(c)+')']
		return '{{'+", ".join(s)+'}}'
	def lbound(self):return self.lbound
	def ubound(self):return self.ubound

	#private:
	def Search(self,f):#Computing minimum of j satisfying f(bit.InitialSegmentSum(j),j) or j==bit.N
		j=s=n=0
		p=1<<17 #131072
		while p:
			k=j|p
			p>>=1
			if k<=self.bit.N:
				n+=self.bit.F[k]
				if f(n,k-1):n=s
				else:s,j=n,k
		return j

R=range
J=lambda:map(int,input().split())
N,Q=J()
A=list(J())
S=BoundedLineMultiSubset(0,N-1)
for i in R(N):
	if A[i]==1:S.insert(i)
for _ in R(Q):
	T,X,Y=J()
	if T==1:
		X-=1
		S.EraseAll(X)
		if Y==1:S.insert(X)
	else:
		X-=1;Y-=1
		l,r=S.ConnectedComponentOf(Y)
		print("SF"[r<Y or ((Y-max(X,l))&1)==(X<l)])
0