可持久化数据结构（1） 可持久化线段树模板

//#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

const int N = 1e6+10;

int val[N], n , m;
int tot, root[N];
struct node{
    int l , r, val;
}tree[N*20];
int v , op , lc , va;
void build(int& rt , int l , int r)
{
    rt =  ++ tot;
    if(l == r)
    {
        tree[rt].val = val[l];
        return ;
    }
    int mid = (l + r) / 2;
    build(tree[rt].l , l , mid);
    build(tree[rt].r, mid + 1, r);
}
void update(int &rt , int l , int r , int k)
{
    int pre = rt;
    rt = ++ tot;
    tree[rt] = tree[pre];
    int mid = (l + r) / 2;
    if(l == r) {
        tree[rt].val = va;
        return ;
    }
    if(k <= mid)
        update(tree[rt].l, l , mid, k);
    else
        update(tree[rt].r, mid + 1, r, k);
}
int query (int rt , int l , int r , int k)
{
    if(l == r)
        return tree[rt].val;
    int mid = (l + r) / 2;
    if (k <= mid)
        return query(tree[rt].l , l , mid, k);
    else
        return query(tree[rt].r , mid + 1,  r, k);
}
int main()
{
    read(n,m);
    for (int i = 1 ; i <= n ; i ++)
        read(val[i]);
    build(root[0], 1, n);
    for (int i = 1; i <= m ; i ++)
    {
        read(v, op);
        if(op == 1)
        {
            read(lc, va);
            root[i] = root[v];
            update(root[i],1,n,lc);
        }
        else
        {
            read(lc);
            write(query(root[v],1,n,lc)), LF;
            root[i] = root[v];
        }
    }
    return 0;
}

//#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

const int N = 1e6+10;

int a[N], n , m;
int tot, root[N];
int lc[N*20] , rc[N*20], val[N*20];
int v , op , loc , va;
void build(int& rt , int l , int r)
{
    rt =  ++ tot;
    if(l == r)
    {
        val[rt] = a[l];
        return ;
    }
    int mid = (l + r) / 2;
    build(lc[rt] , l , mid);
    build(rc[rt], mid + 1, r);
}
void update(int &rt , int l , int r , int k)
{
    int pre = rt;
    rt = ++ tot;
    lc[rt] = lc[pre], rc[rt] = rc[pre] , val[rt] = val[pre];
    int mid = (l + r) / 2;
    if(l == r) {
        val[rt] = va;
        return ;
    }
    if(k <= mid)
        update(lc[rt], l , mid, k);
    else
        update(rc[rt], mid + 1, r, k);
}
int query (int rt , int l , int r , int k)
{
    if(l == r)
        return val[rt];
    int mid = (l + r) / 2;
    if (k <= mid)
        return query(lc[rt] , l , mid, k);
    else
        return query(rc[rt] , mid + 1,  r, k);
}
int main()
{
    read(n,m);
    for (int i = 1 ; i <= n ; i ++)
        read(a[i]);
    build(root[0], 1, n);
    for (int i = 1; i <= m ; i ++)
    {
        read(v, op);
        if(op == 1)
        {
            read(loc, va);
            root[i] = root[v];
            update(root[i],1,n,loc);
        }
        else
        {
            read(loc);
            write(query(root[v],1,n,loc)), LF;
            root[i] = root[v];
        }
    }
    return 0;
}