-
Notifications
You must be signed in to change notification settings - Fork 2
/
h.cpp
61 lines (57 loc) · 1.26 KB
/
h.cpp
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
#include <bits/stdc++.h>
#define endl '\n'
#define eat cin
#define moo cout
#define int long long
#define fi first
#define se second
using namespace std;
int N, Q, S, P[100000], R[100000], J[100000];
void upd(int x){
J[x] = x;
for(int j = 0; j < S; j++){
J[x] = P[J[x]];
}
int cur1 = x, cur2 = J[x];
for(int j = 0; j < S; j++){
cur1 = R[cur1];
cur2 = R[cur2];
J[cur1] = cur2;
}
}
int32_t main(){
eat.tie(0) -> sync_with_stdio(0);
eat >> N >> Q;
S = sqrt(N);
for(int i = 0; i < N; i++){
eat >> P[i];
P[i]--;
}
for(int i = 0; i < N; i++){
R[P[i]] = i;
}
for(int i = 0; i < N; i++){
J[i] = i;
for(int j = 0; j < S; j++) J[i] = P[J[i]];
}
for(int i = 0; i < Q; i++){
int t; eat >> t;
if(t == 1){
int x, y; eat >> x >> y;
x--, y--;
swap(P[x], P[y]);
swap(R[P[x]], R[P[y]]);
upd(x), upd(y);
}else{
int id, k; eat >> id >> k;
id--;
for(int j = 0; j < k/S; j++){
id = J[id];
}
for(int j = 0; j < k%S; j++){
id = P[id];
}
moo << id + 1 << endl;
}
}
}