（时间戳+线段树）华华和月月种树

题意：

思路：

先建好整棵树。

遇到+val操作用dfn对区间+val

遇到加新点清空一下该点的点值（这里保证了之后查询的点肯定是清空过的）

差分+树状数组or线段树

#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
#include <cstdio>//sprintf islower isupper
#include <cstdlib>//malloc  exit strcat itoa system("cls")
#include <iostream>//pair
#include <fstream>//freopen("C:\Users\13606\Desktop\Input.txt","r",stdin);
#include <bitset>
//#include <map>
//#include<unordered_map>
#include <vector>
#include <stack>
#include <set>
#include <string.h>//strstr substr strcat
#include <string>
#include <time.h>// srand(((unsigned)time(NULL))); Seed n=rand()%10 - 0~9;
#include <cmath>
#include <deque>
#include <queue>//priority_queue<int, vector<int>, greater<int> > q;//less
#include <vector>//emplace_back
//#include <math.h>
#include <cassert>
#include <iomanip>
//#include <windows.h>//reverse(a,a+len);// ~ ! ~ ! floor
#include <algorithm>//sort + unique : sz=unique(b+1,b+n+1)-(b+1);+nth_element(first, nth, last, compare)
using namespace std;//next_permutation(a+1,a+1+n);//prev_permutation
//******************
clock_t __START,__END;
double __TOTALTIME;
void _MS(){__START=clock();}
void _ME(){__END=clock();__TOTALTIME=(double)(__END-__START)/CLOCKS_PER_SEC;cout<<"Time: "<<__TOTALTIME<<" s"<<endl;}
//***********************
#define rint register int
#define fo(a,b,c) for(rint a=b;a<=c;++a)
#define fr(a,b,c) for(rint a=b;a>=c;--a)
#define mem(a,b) memset(a,b,sizeof(a))
#define pr printf
#define sc scanf
#define ls rt<<1
#define rs rt<<1|1
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef long long ll;
const double E=2.718281828;
const double PI=acos(-1.0);
const ll INF=(1LL<<60);
const int inf=(1<<30);
const double ESP=1e-9;
const int mod=(int)1e9+7;
const int N=(int)1e6+10;

int c[N],maxn;
int lowbit(int t)
{
    return t&(-t);
}
void add(int i,int t)//i处加t
{
    if(i==0)
    {
        c[0]+=t;
        return;
    }
    while(i<=maxn)
    {
        c[i]+=t;
        i+=lowbit(i);
    }
}
int sum(int i)//求i之前的前缀和
{
    int sum=c[0];
    while(i)
    {
        sum+=c[i];
        i-=lowbit(i);
    }
    return sum;
}

vector<vector<int> >G(N);
struct
{
    int a,b,c;
}op[N];
int dfn[N],SZ[N],tot=-1;
int dfs(int u)
{
    int sz=G[u].size();
    dfn[u]=++tot;
    SZ[u]=1;
    for(int i=0;i<sz;++i)
    {
        int to=G[u][i];
        SZ[u]+=dfs(to);
    }
    return SZ[u];
}

int main()
{
    int n,sz=0;
    sc("%d",&n);
    for(int i=1;i<=n;++i)
    {
        int x;
        sc("%d",&x);
        if(x==1)
        {
            sc("%d",&op[i].b),op[i].a=1,op[i].c=++sz;
            G[op[i].b].push_back(sz);
        //    G[sz].push_back(op[i].b);
        }
        else if(x==2)
            sc("%d%d",&op[i].b,&op[i].c),op[i].a=2;
        else
            sc("%d",&op[i].b),op[i].a=3;
    }
    maxn=sz+10;
    SZ[0]=dfs(0);
    for(int i=1;i<=n;++i)
    {
        if(op[i].a==1)
        {
            int val=sum(dfn[op[i].c]);
            add(dfn[op[i].c],-val);
            add(dfn[op[i].c]+SZ[op[i].c],val);
        }
        else if(op[i].a==2)
        {
            add(dfn[op[i].b],op[i].c);
            add(dfn[op[i].b]+SZ[op[i].b],-op[i].c);
        }
        else
        {
            pr("%d
",sum(dfn[op[i].b]));
        }
//        for(int j=0;j<=3;++j)
//            pr("%d ",sum(dfn[j]));
//        cout<<endl;
    }
    return 0;
}

/**************************************************************************************/