P3384 【模板】树链剖分

https://www.luogu.org/problemnew/show/P3384

总结：路径修改查询，子树修改查询； 

/*#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>*/
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/



const int maxn=1e5+9;
const int mod=1e9+7;

struct E
{
    int to,nex;
}edge[maxn*4];

struct node
{
    ll val,lazy;
}tree[maxn<<2];

int n,m,r,p;
int head[maxn];
int tot;
int rk[maxn],fa[maxn],d[maxn],siz[maxn],son[maxn],top[maxn],id[maxn];
int cnt;
int v[maxn];

void addedge(int u,int v)
{
    edge[tot].to=v;
    edge[tot].nex=head[u];
    head[u]=tot++;
}
void dfs1(int u)
{
    d[u]=d[fa[u]]+1;
    siz[u]=1;
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        int v=edge[i].to;
        if(v==fa[u]) continue;
        fa[v]=u;
        dfs1(v);
        siz[u]+=siz[v];
        if(siz[v]>siz[son[u]])
            son[u]=v;
    }
}
void dfs2(int u,int tp)
{
    top[u]=tp;
    id[u]=++cnt;
    rk[cnt]=u;
    if(!son[u]) return ;
    dfs2(son[u],tp);
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        int v=edge[i].to;
        if(v!=son[u]&&v!=fa[u])
            dfs2(v,v);
    }
}


void pushup(int rt)
{
    tree[rt].val=tree[rt<<1].val+tree[rt<<1|1].val;
    tree[rt].val%=p;
}
void pushdown(int rt,int l,int r)
{
    if(tree[rt].lazy)
    {
        tree[rt<<1].lazy=(tree[rt<<1].lazy+tree[rt].lazy)%p;
        tree[rt<<1|1].lazy=(tree[rt<<1|1].lazy+tree[rt].lazy)%p;
        int mid=(l+r)>>1;
        tree[rt<<1].val=(tree[rt<<1].val+(tree[rt].lazy*(mid-l+1)%p)%p)%p;
        tree[rt<<1|1].val=(tree[rt<<1|1].val+(tree[rt].lazy*(r-mid)%p)%p)%p;
        tree[rt].lazy=0;
    }
}
void build(int rt,int l,int r)
{
    if(l==r)
    {
        tree[rt].val=v[rk[l]];
        return ;
    }
    int mid=(l+r)>>1;
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    pushup(rt);
}
void update(int rt,int l,int r,int ql,int qr,ll val)
{
    if(ql<=l&&qr>=r)
    {
        tree[rt].val=(tree[rt].val+(r-l+1)*val%p)%p;
        tree[rt].lazy=(tree[rt].lazy+val)%p;
        return ;
    }
    pushdown(rt,l,r);
    int mid=(l+r)>>1;
    if(ql<=mid) update(rt<<1,l,mid,ql,qr,val);
    if(qr>mid) update(rt<<1|1,mid+1,r,ql,qr,val);
    pushup(rt);
}
void update_line(int x,int y,ll z)
{
    int tx=top[x];
    int ty=top[y];
    while(tx!=ty)
    {
        if(d[tx]>d[ty]) swap(x,y),swap(tx,ty);
        update(1,1,n,id[ty],id[y],z);
        y=fa[ty];
        ty=top[y];
    }
    if(d[x]>d[y]) swap(x,y);
    update(1,1,n,id[x],id[y],z);
}
ll query(int rt,int l,int r,int ql,int qr)
{
    if(ql<=l&&qr>=r)
    {
        return tree[rt].val;
    }
    pushdown(rt,l,r);
    ll ans=0;
    int mid=(l+r)>>1;
    if(ql<=mid) ans+=query(rt<<1,l,mid,ql,qr),ans%=p;
    if(qr>mid) ans+=query(rt<<1|1,mid+1,r,ql,qr),ans%=p;
    return ans;
}
ll query_line(int x,int y)
{
    ll ans=0;
    int tx=top[x];
    int ty=top[y];
    while(tx!=ty)
    {
        if(d[tx]>d[ty])swap(x,y),swap(tx,ty);
        ans=ans+query(1,1,n,id[ty],id[y]);
        ans%=p;
        y=fa[ty];
        ty=top[y];
    }
    if(d[x]>d[y])swap(x,y);
    ans+=query(1,1,n,id[x],id[y]);
    ans%=p;
    return ans;
}
void update_son(int x,ll z)
{
    update(1,1,n,id[x],id[x]+siz[x]-1,z);
}
ll query_son(int x)
{
    return query(1,1,n,id[x],id[x]+siz[x]-1);
}
void init()
{
    tot=0;
    mem(head,-1);
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    scanf("%d%d%d%d",&n,&m,&r,&p);
    init();
    for(int i=1;i<=n;i++)
    {
        sfl(v[i]);
    }
    for(int i=1;i<n;i++)
    {
        int uu,vv;
        scanf("%d%d",&uu,&vv);
        addedge(uu,vv);
        addedge(vv,uu);
    }
    cnt=0;
    dfs1(r);
    dfs2(r,r);
    build(1,1,n);
    while(m--)
    {
        int op;
        sfi(op);
        int x,y;
        ll z;
        if(op==1)
        {
            scanf("%d%d%lld",&x,&y,&z);
            update_line(x,y,z);
        }
        else if(op==2)
        {
            scanf("%d%d",&x,&y);
            printf("%lld\n",query_line(x,y));

        }
        else if(op==3)
        {
            scanf("%d%lld",&x,&z);
            update_son(x,z);
        }
        else
        {
            scanf("%d",&x);
            printf("%lld\n",query_son(x));
        }

    }


    return 0;
}