luogu 3919

主席树

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>

using namespace std;

#define LL long long

#define gc getchar()
inline int read() {int x = , f = ; char c = gc;
while(c < '' || c > '') {if(c == '-') f = -; c = gc;};
while(c >= '' && c <= '') x = x *  + c - '', c = gc; return x * f;}
inline LL read_LL() {LL x = ; char c = gc; while(c < '' || c > '') c = gc;
while(c >= '' && c <= '') x = x *  + c - '', c = gc; return x;}
#undef gc

const int N = 1e6 + ;

int W[N *  * ], Lson[N *  * ], Rson[N *  * ];
int Root[N];
int Hjt;
int n, q;

void Build_tree(int l, int r, int &rt) {
    rt = ++ Hjt;
    if(l == r) {
        W[rt] = read();
        return ;
    }
    int mid = (l + r) >> ;
    Build_tree(l, mid, Lson[rt]), Build_tree(mid + , r, Rson[rt]);
}

void Fill(int x, int y) {
    W[x] = W[y], Lson[x] = Lson[y], Rson[x] = Rson[y];
}

void Poi_G(int &rt, int l, int r, int x, int val) {
    Fill(++ Hjt, rt);
    rt = Hjt;
    if(l == r) {
        W[rt] = val;
        return ;
    }
    int mid = (l + r) >> ;
    if(x <= mid) Poi_G(Lson[rt], l, mid, x, val);
    else Poi_G(Rson[rt], mid + , r, x, val);
}

int Ans;

void Poi_A(int rt, int l, int r, int x) {
    if(l == r) {
        Ans = W[rt];
        return ;
    }
    int mid = (l + r) >> ;
    if(x <= mid) Poi_A(Lson[rt], l, mid, x);
    else Poi_A(Rson[rt], mid + , r, x);
}

int main() {
    n = read(), q = read();
    Build_tree(, n, Root[]);
    for(int i = ; i <= q; i ++) {
        int v = read(), opt = read(), loc = read(), val;
        if(opt == ) val = read();
        if(opt == ) {
            Root[i] = Root[v];
            Poi_G(Root[i], , n, loc, val);
        } else {
            Poi_A(Root[v], , n, loc);
            Root[i] = Root[v];
            cout << Ans << "\n";
        }
    }
    return ;
}