1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
import sys
from itertools import *
from collections import *
from heapq import *
from bisect import *
input = lambda: sys.stdin.readline().rstrip()
def II(base=10): return int(input(),base)
def LII(): return list(map(int,input().split()))
def LSII(): return [int(x)-1 for x in input().split()]
fmin = lambda x,y: x if x<y else y
fmax = lambda x,y: x if x>y else y
class Seg:
def __init__(self,n):
self.n = n
self.N = N = 1<<n.bit_length()
self.t = [-1]*N*2
def merge(self,a,b): # 区间信息怎么合并的
if a==-2 or b==-2:
return -2
if a==-1 or b==-1:
return max(a,b)
return a if a==b else -2
def build(self,A):
for i,a in enumerate(A):
self.t[self.N+i] = a
for o in range(self.N-1,0,-1):
self.pull(o)
def pull(self,o):
self.t[o] = self.merge(self.t[o*2],self.t[o*2+1])
def upd(self,a,x):
a += self.N
self.t[a] = x
while a>>1:
a >>= 1
self.pull(a)
def query(self,a,b):
a,b = a+self.N-1,b+self.N+1
lres,rres = self.t[0],self.t[0]
while a^b^1:
if not a&1: lres = self.merge(lres,self.t[a^1])
if b&1: rres = self.merge(self.t[b^1],rres)
a,b = a>>1,b>>1
return self.merge(lres,rres)
n,q = LII()
A = LII()
seg = Seg(n)
seg.build(A)
for _ in range(q):
tp,l,r = LII()
if tp==1:
seg.upd(l-1,r)
else:
print('Yes' if seg.query(l-1,r-1)!=-2 else 'No')
|