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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ten5 100000+10
#define MOD 1000000007
#define rep(i, a, n) for (int i=a;i<n;i++)
#define iif(c, t, f) ((c)?(t):(f))
#define per(i, a, n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
const int N = 200010;
int n;
struct vertex {
int dep;
int v;
int _in;
int _out;
} i2v[N];
int v2i[N];
const int Log = 22;
int fa[N][Log + 1];
vector<int> child[N];
pair<int, int> T[N << 2];
void dfs(int i, int dep, int &idx) {
i2v[i].dep = dep;
i2v[i]._in = idx++;
for (auto item:child[i])
dfs(item, dep + 1, idx);
i2v[i]._out = idx++;
}
int Jump(int x, int d) {
if (d < 0)
return x;
per(i, 0, Log + 1){
if ((d >> i) & 1)
x = fa[x][i];
}
return x;
}
int LCA(int l, int r) {
int d = i2v[l].dep - i2v[r].dep;
if (d < 0) {
swap(l, r);
d = -d;
}
l = Jump(l, d);
if (l == r)
return l;
per(i, 0, Log + 1){
if (fa[l][i] != fa[r][i]) {
l = fa[l][i];
r = fa[r][i];
}
}
return fa[l][0];
}
bool onpath(int idx, int l_idx, int r_idx) {
int anc = LCA(l_idx, r_idx);
if (i2v[anc].dep > i2v[idx].dep)
return false;
return
Jump(l_idx, i2v[l_idx].dep - i2v[idx].dep) == idx ||
Jump(r_idx, i2v[r_idx].dep - i2v[idx].dep) == idx;
}
pair<int, int> mergeT(const pair<int, int> &v1, const pair<int, int> &v2) {
int arr[] = {v1.fi, v1.se, v2.fi, v2.se};
rep(i, 0, 4){
if (arr[i] == -1)
return {-1, -1};
}
int l_leaf = arr[0];
rep(i, 0, 4) {
if (i2v[arr[i]]._out < i2v[l_leaf]._out)
l_leaf = arr[i];
}
int r_leaf = arr[0];
rep(i, 0, 4) {
if (i2v[arr[i]]._in > i2v[r_leaf]._in)
r_leaf = arr[i];
}
if (l_leaf == r_leaf) {
int rt = arr[0];
rep(i, 0, 4) {
if (i2v[arr[i]].dep < i2v[rt].dep)
rt = arr[i];
}
return {l_leaf, rt};
} else {
rep(i, 0, 4) {
if (!onpath(arr[i], l_leaf, r_leaf))
return {-1,-1};
}
}
return {l_leaf, r_leaf};
}
pair<int, int> initSeg(int o, int l, int r) {
if (l == r)
return T[o] = {v2i[l], v2i[r]};
int mid = (l + r) / 2;
return T[o] = mergeT(
initSeg(o << 1, l, mid),
initSeg(o << 1 | 1, mid + 1, r));
}
void updateSeg(int o, int l, int r, const int &val) {
if (l == r) {
T[o] = {v2i[val], v2i[val]};
return;
}
int mid = (l + r) / 2;
if (val <= mid)
updateSeg(o << 1, l, mid, val);
else
updateSeg(o << 1 | 1, mid + 1, r, val);
T[o] = mergeT(T[o << 1], T[o << 1 | 1]);
}
int query(int o, int l, int r, const pair<int, int> &now) {
if (l == r)
return mergeT(now, T[o]).fi == -1 ? l : l + 1;
int mid = (l + r) / 2;
auto tmp = mergeT(now, T[o << 1]);
if (tmp.fi == -1)
return query(o << 1, l, mid, now);
else
return query(o << 1 | 1, mid + 1, r, tmp);
}
int main() {
cin >> n;
rep(i, 1, n + 1) {
scanf("%d", &i2v[i].v);
v2i[i2v[i].v] = i;
}
rep(i, 2, n + 1) {
scanf("%d", &fa[i][0]);
child[fa[i][0]].pb(i);
}
rep(j, 1, Log + 1) {
rep(i, 1, n + 1) {
fa[i][j] = fa[fa[i][j - 1]][j - 1];
}
}
int idx = 1;
dfs(1, 1, idx);
initSeg(1, 0, n - 1);
int Q;
cin >> Q;
while (Q--) {
int t;
scanf("%d", &t);
if (t == 1) {
int i, j;
scanf("%d %d", &i, &j);
swap(v2i[i2v[i].v], v2i[i2v[j].v]);
swap(i2v[i].v, i2v[j].v);
updateSeg(1, 0, n - 1, i2v[i].v);
updateSeg(1, 0, n - 1, i2v[j].v);
} else {
pair<int, int> st = {v2i[0], v2i[0]};
printf("%d\n", query(1, 0, n - 1, st));
}
}
return 0;
}
|
