重链剖分-维护点权模版

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue

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 maxn = 10000005;
int cnt = 0, head[10000005];
struct node{
    int next, t;
}edge[2*maxn];
void add(int f, int t)
{
    edge[cnt].t = t;
    edge[cnt].next = head[f];
    head[f] = cnt ++;
}
int n, m, rt, p;
int value[maxn]; //节点值
int fa[maxn] , deep[maxn] , son[maxn] , size[maxn];
//   父亲        深度         重儿子       子树大小
int dfn[maxn] ,top[maxn], id[maxn], tot = 0;
//   dfs序编号    重链顶端  dfs序对应节点
void dfs1(int u)
{
    size[u] = 1;
    for(int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t;
        if(v != fa[u])
        {
            fa[v] = u;
            deep[v] = deep[u] + 1;
            dfs1(v);
            size[u] += size[v];
            if(size[v] > size[son[u]])
                son[u] = v;
        }
    }
}
void dfs2(int u ,int t)
{
    top[u] = t;
    dfn[u] = ++tot;
    id[tot] = u;
    if(son[u]) dfs2(son[u],t);
    for(int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t;
        if(v != son[u] && v != fa[u])
            dfs2(v,v);
    }
}
struct tree_node
{
    int l , r;
    ll sum ,lz;
}tree[maxn << 2];
void pushdown(int i)
{
    if(tree[i].lz != 0)
    {
        tree[i*2].lz += tree[i].lz;
        tree[i*2+1].lz += tree[i].lz;
        int mid = (tree[i].l+tree[i].r)/2;
        tree[i*2].sum += tree[i].lz*(mid - tree[i*2].l + 1);
        tree[i*2].sum %= p;
        tree[i*2+1].sum += tree[i].lz*(tree[i*2+1].r - mid);
        tree[i*2+1].sum %= p;
        tree[i].lz = 0;
    }
    return ;
}
void build(int i , int l , int r)
{
    tree[i].l = l, tree[i].r = r, tree[i].lz = 0, tree[i].sum = 0;
    if(l == r)
    {
        tree[i].sum = value[id[l]];
        return ;
    }
    int mid = (l + r) >> 1;
    build(i*2,l,mid);
    build(i*2+1,mid+1,r);
    tree[i].sum = tree[i*2].sum + tree[i*2+1].sum;
    tree[i].sum %= p;
}
void update(int i , int l , int r , int k)
{
    if(tree[i].l >= l && tree[i].r <= r)
    {
        tree[i].sum += (tree[i].r-tree[i].l+1)*k;
        tree[i].lz += k;
        return ;
    }
    pushdown(i);
    if(l <= tree[i*2].r)
        update(i*2,l,r,k);
    if(tree[i*2+1].l <= r)
        update(i*2+1,l,r,k);
    tree[i].sum = tree[i*2].sum + tree[i*2+1].sum;
    tree[i].sum %= p;
    return ;
}
ll search(int i , int l , int r)
{
    if(tree[i].l >= l && tree[i].r <= r) {
        return tree[i].sum;
    }
    if(l > tree[i].r || r < tree[i].l)
        return 0;
    pushdown(i);
    ll ans = 0;
    if(tree[i*2].r >= l) {
        ans += search(i * 2, l, r);
        ans %= p;
    }
    if(tree[i*2+1].l <= r) {
        ans += search(i * 2 + 1, l, r);
        ans %= p;
    }
    return ans%p;
}
void TreeAdd(int x, int y, int val)
{
    while(top[x] != top[y])
    {
        if(deep[top[x]] < deep[top[y]])
            swap(x,y);
        update(1,dfn[top[x]], dfn[x], val);
        x = fa[top[x]];
    }
    if(deep[x] > deep[y]) swap(x,y);
    update(1,dfn[x],dfn[y],val);
}
void TreeSum(int x, int y)
{
    int ans = 0;
    while(top[x] != top[y])
    {
        if(deep[top[x]] < deep[top[y]])
            swap(x,y);
        ans = ans + search(1,dfn[top[x]], dfn[x]);
        ans %= p;
        x = fa[top[x]];
    }
    if(deep[x] > deep[y])
        swap(x,y);
    ans = ans + search(1,dfn[x],dfn[y]);
    cout<<ans%p<<endl;
}
int main(void)
{
    mem(head,-1);
    cin>>n>>m>>rt>>p;
    for(int i = 1 ; i <= n ; i ++)
        cin>>value[i];
    for(int i = 1 ; i <= n-1 ; i ++)
    {
        int u , v;
        cin>>u>>v;
        add(u,v);
        add(v,u);
    }
    dfs1(rt);
    dfs2(rt,rt);
    build(1,1,n);
    for(int i = 1 ; i <= m ; i ++)
    {
        int op, x , y, z;
        cin>>op;
        if(op == 1)
        {
            cin>>x>>y>>z;
            TreeAdd(x,y,z%p);
        }
        else if(op == 2)
        {
            cin>>x>>y;
            TreeSum(x,y);
        }
        else if(op == 3)
        {
            cin>>x>>z;
            update(1,dfn[x],dfn[x]+size[x]-1,z%p);
        }
        else
        {
            cin>>x;
            cout<<search(1,dfn[x],dfn[x]+size[x]-1)<<endl;
        }
    }
}