树 ssl 2387 水过

题目大意

分析

不需要每次更新都去递归。
储存起来，查询时查一下从这个点到根做了哪些修改就好了。

ps：久违的ssl题库

code

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

using namespace std;

struct arr{
    int x,y;
    int next;
    int flag;
}edge[500000];
int ls[500000];
int edge_m;
int sum[500000];
int f[500000];
int root[500000];
int n,m;
int ans;

void add(int x,int y)
{
    edge_m++;
    edge[edge_m]=(arr){x,y,ls[x],0};
    ls[x]=edge_m;
    edge_m++;
    edge[edge_m]=(arr){y,x,ls[y],0};
    ls[y]=edge_m;
    return;
}

void maketree(int r,int x)
{
    for (int i=ls[x];i;i=edge[i].next)
    {
        if (edge[i].y==r)
        {
            edge[i].flag=1;
            root[x]=r;
        }
        else maketree(x,edge[i].y);
    }
    return;
}

void find(int x,int dep)
{
    while (x)
    {
        if ((dep%2)==0)
            ans+=sum[x];
        else
            ans-=sum[x];
        dep++;
        x=root[x];
    }
    return;
}

int main()
{
    //freopen("tree.in", "r", stdin);
    //freopen("tree.out", "w", stdout); 
    edge_m=0;
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&f[i]);
    }
    for (int i=1;i<n;i++)
    {
        int x1,y1;
        scanf("%d%d",&x1,&y1);
        add(x1,y1);
    }
    maketree(0,1);
    for (int i=1;i<=m;i++)
    {
        int x,y,w;
        scanf("%d",&w);
        if (w==1)
        {
            scanf("%d%d",&x,&y);
            sum[x]+=y;
        }
        if (w==2)
        {
            scanf("%d",&x);
            ans=f[x];
            find(x,0);
            printf("%d\n",ans);
        }
    }
    return 0;
    fclose(stdin);
    fclose(stdout);
}