//Place your snippets for cpp here. Each snippet is defined under a snippet name and has a prefix, body and 
// description. The prefix is what is used to trigger the snippet and the body will be expanded and inserted. Possible variables are:
// $1, $2 for tab stops, $0 for the final cursor position, and ${1:label}, ${2:another} for placeholders. Placeholders with the 
// same ids are connected.
// prefix 的格式要求是 acm-[一级标题编号].[二级标题编号][该代码片段的英文简称]
// description 的格式要求是 "插入 [该代码片段的中文名]"

{
    "点分树-在线求原树距离-BIT": {
        "prefix": "acm-4.3求距离小于等于K的点权值之和 震波",
        "body": [
            "#include<algorithm>",
            "#include<cstring>",
            "#include<cstdio>",
            "#include<vector>",
            "#define LL long long",
            "#define Re register int",
            "using namespace std;",
            "const int N=1e5+3,inf=2e9,logN=17;",
            "int n,m,o,x,y,T,op,lastans,A[N],deep[N],head[N];",
            "struct QAQ{int to,next;}a[N<<1];",
            "inline void add(Re x,Re y){a[++o].to=y,a[o].next=head[x],head[x]=o;}",
            "inline void in(Re &x){",
            "    int f=0;x=0;char c=getchar();",
            "    while(c<'0'||c>'9')f|=c=='-',c=getchar();",
            "    while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();",
            "    x=f?-x:x;",
            "}",
            "struct LCA{",
            "\tint fa[N],top[N],son[N],size[N];",
            "\tinline void dfs1(Re x,Re Fa){",
            "\t\tsize[x]=1,deep[x]=deep[fa[x]=Fa]+1;",
            "\t\tfor(Re i=head[x],to;i;i=a[i].next)",
            "\t\t\tif((to=a[i].to)!=Fa){",
            "\t\t\t\tdfs1(to,x),size[x]+=size[to];",
            "\t\t\t\tif(size[son[x]]<size[to])son[x]=to;",
            "\t\t\t}",
            "\t}",
            "\tinline void dfs2(Re x,Re rt){",
            "\t\ttop[x]=rt;",
            "\t\tif(!son[x])return;",
            "\t\tdfs2(son[x],rt);",
            "\t\tfor(Re i=head[x],to;i;i=a[i].next)",
            "\t\t\tif((to=a[i].to)!=fa[x]&&to!=son[x])dfs2(to,to);",
            "\t}",
            "\tinline void build(){dfs1(1,0),dfs2(1,1);}",
            "\tinline int lca(Re x,Re y){",
            "\t\twhile(top[x]!=top[y]){",
            "\t\t\tif(deep[top[x]]<deep[top[y]])swap(x,y);",
            "\t\t\tx=fa[top[x]];",
            "\t\t}",
            "\t\tif(deep[x]>deep[y])swap(x,y);",
            "\t\treturn x;",
            "\t}",
            "}T1;",
            "inline int Dis(Re x,Re y){return deep[x]+deep[y]-(deep[T1.lca(x,y)]<<1);}",
            "struct BIT{",
            "\tint n;vector<int>C;",
            "\tinline void build(Re N){C.resize((n=N)+1);}",
            "\tinline void add(Re x,Re v){++x;while(x<=n)C[x]+=v,x+=x&-x;}",
            "\tinline int ask(Re x){++x,x=min(x,n);Re ans=0;while(x)ans+=C[x],x-=x&-x;return ans;}",
            "}TR1[N],TR2[N];",
            "int rt,sum,fa[N],vis[N],maxp[N],size[N];",
            "inline void getrt(Re x,Re fa){",
            "\tsize[x]=1,maxp[x]=0;",
            "\tfor(Re i=head[x],to;i;i=a[i].next)",
            "\t\tif(!vis[to=a[i].to]&&to!=fa)",
            "\t\t\tgetrt(to,x),size[x]+=size[to],maxp[x]=max(maxp[x],size[to]);",
            "\tmaxp[x]=max(maxp[x],sum-size[x]);",
            "\tif(maxp[x]<maxp[rt])rt=x;",
            "}",
            "inline void sakura(Re x,Re Fa){",
            "\tRe now=sum;vis[x]=1,fa[x]=Fa;",
            "\tTR1[x].build(now/2+1),TR2[x].build(now+1);",
            "\tfor(Re i=head[x],to;i;i=a[i].next)",
            "\t\tif(!vis[to=a[i].to])",
            "\t\t\tsum=size[to]>size[x]?now-size[x]:size[to],maxp[rt=0]=inf,getrt(to,0),sakura(rt,x);",
            "}",
            "inline void change(Re x,Re v){",
            "\tTR1[x].add(0,v);//subtree(x)",
            "\tfor(Re i=x;fa[i];i=fa[i]){",
            "\t\tRe tmp=Dis(x,fa[i]);",
            "\t\tTR1[fa[i]].add(tmp,v);",
            "\t\tTR2[i].add(tmp,v);",
            "\t}",
            "}",
            "inline int ask(Re x,Re K){",
            "\tRe ans=TR1[x].ask(K);//subtree(x)",
            "\tfor(Re i=x;fa[i];i=fa[i]){",
            "\t\tRe tmp=Dis(x,fa[i]);if(tmp>K)continue;",
            "\t\tans+=TR1[fa[i]].ask(K-tmp);",
            "\t\tans-=TR2[i].ask(K-tmp);",
            "\t}",
            "\treturn ans;",
            "}",
            "int main(){",
            "//\tfreopen(\"123.txt\",\"r\",stdin);",
            "\tin(n),in(T),m=n-1;",
            "\tfor(Re i=1;i<=n;++i)in(A[i]);",
            "\twhile(m--)in(x),in(y),add(x,y),add(y,x);",
            "\tT1.build(),sum=n,maxp[rt=0]=inf,getrt(1,0),sakura(rt,0);",
            "\tfor(Re i=1;i<=n;++i)change(i,A[i]);",
            "\twhile(T--){",
            "\t\tin(op),in(x),in(y),x^=lastans,y^=lastans;",
            "\t\tif(op)change(x,y-A[x]),A[x]=y;",
            "\t\telse printf(\"%d\\n\",lastans=ask(x,y));",
            "\t}",
            "}",
            ""
        ],
        "description": "插入 点分树-在线求原树距离-BIT"
    }
}