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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
using namespace std;
const int MAXN = 400000;
namespace IO
{
const int MAXSIZE = 1 << 20;
char buf[MAXSIZE], *p1, *p2;
#define gc() \
(p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) \
? EOF \
: *p1++)
inline int rd()
{
int x = 0, f = 1;
char c = gc();
while (!isdigit(c))
{
if (c == '-')
f = -1;
c = gc();
}
while (isdigit(c))
x = x * 10 + (c ^ 48), c = gc();
return x * f;
}
char pbuf[1 << 20], *pp = pbuf;
inline void push(const char &c)
{
if (pp - pbuf == 1 << 20)
fwrite(pbuf, 1, 1 << 20, stdout), pp = pbuf;
*pp++ = c;
}
inline void write(int x)
{
static int sta[35];
int top = 0;
do
{
sta[top++] = x % 10, x /= 10;
} while (x);
while (top)
push(sta[--top] + '0');
}
} // namespace IO
///////////////////////////////////////////////////////////////////////////////////////
int dat[MAXN];
int a[MAXN];
int lc[MAXN], rc[MAXN], idx = 0;
inline int imax(int a,int b){
if(a>b)return a;
return b;
}
void collect(int n)
{
dat[n] = max(dat[lc[n]], dat[rc[n]]);
}
int build(int &n, int l, int r)
{
if (!n)
n = ++idx;
dat[n] = a[l];
if (l == r)
return dat[n];
int mid = (l + r) / 2;
return dat[n] = imax(build(lc[n], l, mid), build(rc[n], mid + 1, r));
}
void modify(int x, int l, int r, int L, int R, int n)
{
if (l <= L && R <= r)
{
dat[n] = x;
return;
}
int mid = (L + R) / 2;
if (l <= mid)
modify(x, l, r, L, mid, lc[n]);
if (mid < r)
modify(x, l, r, mid + 1, R, rc[n]);
collect(n);
}
int query(int l, int r,int target, int L, int R, int n)
{
if(L>r || R<l || dat[n]<=target)return -1;
if(L==R)return L;
int mid = (L + R) / 2;
int res=query(l,r,target,L,mid,lc[n]);
return ~res?res:query(l,r,target,mid+1,R,rc[n]);
}
int root;
int num[MAXN];
int main()
{
int kase=IO::rd();
while (kase--)
{
int nlen, qlen;
nlen=IO::rd();
qlen=IO::rd();
for (int i = 1; i <= nlen; i++)
{
num[i] = IO::rd();
a[num[i]] = i;
}
build(root, 1, nlen);
int lastans = 0;
while (qlen--)
{
int opt=IO::rd();
if (opt == 1)
{
int pos=IO::rd();
pos ^= lastans;
if(num[pos]==0 || num[pos]>nlen)continue;
modify(0x3f3f3f3f, num[pos], num[pos], 1, nlen, root);
}
else
{
int t2, t3;
t2=IO::rd();
t3=IO::rd();
//cin >> t2 >> t3;
int r = t2 ^ lastans, k = t3 ^ lastans;
int t=query(k,nlen,r,1,nlen,root);
cout<<(lastans=(~t?t:nlen+1))<<endl;
}
}
}
return 0;
}
|