結果

問題 No.2879 Range Flip Queries
ユーザー YuuuT
提出日時 2024-09-08 12:41:51
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 444 ms / 2,000 ms
コード長 6,021 bytes
コンパイル時間 376 ms
コンパイル使用メモリ 82,700 KB
実行使用メモリ 163,088 KB
最終ジャッジ日時 2024-09-08 12:42:04
合計ジャッジ時間 12,279 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

# oj t -c "python3 main.py"
import sys,math
from collections import defaultdict,deque
from itertools import combinations,permutations,accumulate,product
from bisect import bisect_left,bisect_right
from heapq import heappop,heappush,heapify
#from more_itertools import distinct_permutations,distinct_combinations
#from sortedcontainers import SortedList,SortedSet
def input():return sys.stdin.readline().rstrip()
def ii(): return int(input())
def ms(): return map(int, input().split())
def li(): return list(map(int,input().split()))
inf = pow(10,18)
mod = 998244353
#/////////////////////////////////
N,Q = ms()
A = li()
class lazy_segtree(): # 0-index
def _update(self,k):self.data[k]=self.op(self.data[2*k],self.data[2*k+1])
def _all_apply(self,k,f):
self.data[k]=self.mapping(f,self.data[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.data=[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.data[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.data[p]=x
for i in range(1,self.log+1):self._update(p>>i)
# data[p]
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.data[p]
# [l,r)
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.data[l])
l+=1
if r&1:
r-=1
smr=self.op(self.data[r],smr)
l>>=1
r>>=1
return self.op(sml,smr)
#
def all_prod(self):return self.data[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.data[p]=self.mapping(f,self.data[p])
for i in range(1,self.log+1):self._update(p>>i)
#
# f mapping f
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)
# check(operate(data[l],data[l+1],...,data[r-1])) = True
# r
def max_right(self,l,check):
assert 0<=l and l<=self.n
assert check(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(check(self.op(sm,self.data[l]))):
while(l<self.size):
self._push(l)
l=(2*l)
if (check(self.op(sm,self.data[l]))):
sm=self.op(sm,self.data[l])
l+=1
return l-self.size
sm=self.op(sm,self.data[l])
l+=1
if (l&-l)==l:break
return self.n
# check(operate(data[l],data[l+1],...,data[r-1])) = True
# l
def min_left(self,r,check):
assert (0<=r and r<=self.n)
assert check(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(check(self.op(self.data[r],sm))):
while(r<self.size):
self._push(r)
r=(2*r+1)
if g(self.op(self.data[r],sm)):
sm=self.op(self.data[r],sm)
r-=1
return r+1-self.size
sm=self.op(self.data[r],sm)
if (r&-r)==r:break
return 0
# data
e = 0
# lazy
# lazy
ide = 0
#
def operate(a,b):
return a+b
# data
# f x data
# ex. f+x
def mapping(f,x):
#
# if f==ide: return x
return f+x
#
# f g
def composition(f,g):
#
# if f==ide: return g
return f+g
seg = lazy_segtree(A,operate,e,mapping,composition,ide)
# //////////////////
acc = [0]*(N+1)
for _ in range(Q):
l,r = ms()
l -= 1
r -= 1
acc[l] += 1
acc[r+1] -= 1
acc = list(accumulate(acc))
for i in range(N):
if acc[i]%2==0:
print(A[i],end=" ")
else:
print(1-A[i],end=" ")
print()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0