树剖模板

来源：互联网发布：淘宝开店预存金额编辑：程序博客网时间：2024/04/29 16:24
#include<cstdio>#include<cctype>#include<cstring>#include<algorithm>using namespace std;inline long long read(){    long long x = 0, flag = 1;    char c;    while(! isdigit(c = getchar()))        if(c == '-')            flag *= - 1;    while(isdigit(c))         x = x * 10 + c - '0', c = getchar();    return x * flag;}const long long MAXN = (long long)1e5 + (1 << 5);long long w[MAXN];long long top;struct edge{    long long v, next;}G[MAXN << 1];long long head[MAXN];long long n, m, root, MOD;void add_edge(long long u, long long v){    G[top].v = v;    G[top].next = head[u];    head[u] = top ++;}struct node{    long long w, dep, fa, son, size, top, ID, last;   }a[MAXN];void DFS1(long long u, long long fa){    a[u].dep = a[fa].dep + 1;    a[u].fa = fa;    a[u].size = 1;    a[u].son = - 1;    for(long long i = head[u]; i != - 1; i = G[i].next)    {        long long v = G[i].v;        if(v == fa)            continue;        DFS1(v, u);        a[u].size += a[v].size;        if(a[u].son == - 1 || a[v].size > a[a[u].son].size)            a[u].son = v;    }}long long cnt;void DFS2(long long u, long long top){    a[u].top = top;    a[u].ID = ++ cnt;    if(a[u].son == - 1)    {        a[u].last = a[u].ID;        return;    }    DFS2(a[u].son, top);    for(long long i = head[u]; i != - 1; i = G[i].next)        if(G[i].v != a[u].son && G[i].v != a[u].fa)            DFS2(G[i].v, G[i].v);    a[u].last = cnt;}struct segmenttree{    long long sum, tag;}T[MAXN << 2]; void modify(long long u, long long curL, long long curR, long long L, long long R, long long delta){    if(curL >= L && curR <= R)    {        T[u].tag += delta;        T[u].sum += delta * (curR - curL + 1);        return;     }    long long mid = (curL + curR) >> 1;    if(L <= mid)        modify(u << 1, curL, mid, L, R, delta);    if(R > mid)        modify((u << 1) + 1, mid + 1, curR, L, R, delta);    T[u].sum += (min(curR, R) - max(curL, L) + 1) * delta;}void update(long long u, long long v, long long delta){    while(a[u].top != a[v].top)    {        if(a[a[u].top].dep < a[a[v].top].dep)            swap(u, v);        modify(1, 1, n, a[a[u].top].ID, a[u].ID, delta);        u = a[a[u].top].fa;     }    if(a[u].ID < a[v].ID)        modify(1, 1, n, a[u].ID, a[v].ID, delta);    else        modify(1, 1, n, a[v].ID, a[u].ID, delta);}long long query(long long u, long long curL, long long curR, long long L, long long R){    if(curL >= L && curR <= R)        return T[u].sum;    long long mid = (curL + curR) >> 1, ret = 0;    if(L <= mid)        ret += query(u << 1, curL, mid, L, R);    if(R > mid)        ret += query((u << 1) + 1, mid + 1, curR, L, R);    ret += (min(curR, R) - max(curL, L) + 1) * T[u].tag;    return ret;}long long ask(long long u, long long v){    long long ret = 0;    while(a[u].top != a[v].top)    {        if(a[a[u].top].dep < a[a[v].top].dep)            swap(u, v);        ret += query(1, 1, n, a[a[u].top].ID, a[u].ID);        u = a[a[u].top].fa;    }    if(a[u].ID < a[v].ID)        ret += query(1, 1, n, a[u].ID, a[v].ID);    else        ret += query(1, 1, n, a[v].ID, a[u].ID);    return ret;}void print(long long x){    if(x < 0)        putchar('-');    if(x == 0)        putchar('0');    long long top = 0, ans[36];    while(x)        ans[top ++] = x % 10, x /= 10;    for(; top; top --)        putchar(ans[top - 1] + '0');}int main(){    #ifndef ONLINE_JUDGE    freopen("L3384.in", "r", stdin);    freopen("L3384.out", "w", stdout);    #endif    n = read(), m = read(), root = read(), MOD = read();    for(long long i = 1; i <= n; i ++)        a[i].w = read();    top = 0;    memset(head, - 1, sizeof(head));    for(long long i = 1; i < n; i ++)    {        long long u = read(), v = read();        add_edge(u, v);        add_edge(v, u);    }    a[root].dep = - 1;    DFS1(root, root);    cnt = 0;    DFS2(root, root);    memset(T, 0, sizeof(T));     for(long long i = 1; i <= n; i ++)        modify(1, 1, n, a[i].ID, a[i].ID, a[i].w);    for(long long i = 0; i < m; i ++)    {        long long opt = read();        switch (opt)        {            case 1:                {                    long long u = read(), v = read(), delta = read();                    update(u, v, delta);                    break;                }            case 2:                {                    long long u = read(), v = read();                    print(ask(u, v) % MOD);                    putchar('\n');                    break;                }            case 3:                {                    long long u = read(), delta = read();                    modify(1, 1, n, a[u].ID, a[u].last, delta);                    break;                }            case 4:                {                    long long u = read();                    print(query(1, 1, n, a[u].ID, a[u].last) % MOD);                    putchar('\n');                    break;                }        }    }}
0 0