Tree（树链剖分、线段树）

题意

给定一棵节点个数为$n$的树，每个点都有点权$a_i$。支持两种操作：

• 一条路径上的所有点权开根号
• 查询一条路径上的点权和

现在有$m$个操作

数据范围

$1\le n,m\le 10^5$
$0\le a_i\le 10^9$

思路

树链剖分模板+花神游历各国。

代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>

using namespace std;

typedef long long ll;

const int N = 100010, M = 2 * N;

int n, m;
int h[N], w[N], e[M], ne[M], idx;
int id[N], nw[N], cnt;
int fa[N], son[N], sz[N], depth[N], top[N];

struct Node
{
    int l, r;
    ll sum;
    bool flag;
}tr[N * 4];

void add(int a,int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}

void dfs1(int u,int father,int d)
{
    depth[u] = d, sz[u] = 1, fa[u] = father;
    for(int i=h[u];~i;i=ne[i]){
        int j = e[i];
        if(j == father) continue;
        dfs1(j,u,d+1);
        sz[u] += sz[j];
        if(sz[son[u]] < sz[j]) son[u] = j;
    }
}

void dfs2(int u,int t)
{
    id[u] = ++ cnt, nw[cnt] = w[u], top[u] = t;
    if(!son[u]) return;
    dfs2(son[u],t);
    for(int i=h[u];~i;i=ne[i]){
        int j = e[i];
        if(j == fa[u] || j == son[u]) continue;
        dfs2(j,j);
    }
}

void pushup(int u)
{
    tr[u].sum = tr[u<<1].sum + tr[u<<1|1].sum;
    tr[u].flag = tr[u<<1].flag && tr[u<<1|1].flag;
}

void build(int u,int l,int r)
{
    tr[u] = {l,r,nw[r],nw[r]<=1};
    if(l == r) return;
    int mid = l + r >> 1;
    build(u<<1,l,mid), build(u<<1|1,mid+1,r);
    pushup(u);
}

void modify(int u,int l,int r)
{
    if(tr[u].flag) return;
    if(tr[u].l == tr[u].r){
        tr[u].sum = sqrt(tr[u].sum);
        tr[u].flag = tr[u].sum <= 1;
        return;
    }
    int mid = tr[u].l + tr[u].r >> 1;
    if(l <= mid) modify(u<<1,l,r);
    if(r > mid) modify(u<<1|1,l,r);
    pushup(u);
}

ll query(int u,int l,int r)
{
    if(tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
    int mid = tr[u].l + tr[u].r >> 1;
    ll res = 0;
    if(l <= mid) res += query(u<<1,l,r);
    if(r > mid) res += query(u<<1|1,l,r);
    return res;
}

void modify_path(int u,int v)
{
    while(top[u] != top[v]){
        if(depth[top[u]] < depth[top[v]]) swap(u, v);
        modify(1,id[top[u]],id[u]);
        u = fa[top[u]];
    }
    if(depth[u] < depth[v]) swap(u, v);
    modify(1,id[v],id[u]);
}

ll query_path(int u,int v)
{
    ll res = 0;
    while(top[u] != top[v]){
        if(depth[top[u]] < depth[top[v]]) swap(u, v);
        res += query(1,id[top[u]],id[u]);
        u = fa[top[u]];
    }
    if(depth[u] < depth[v]) swap(u, v);
    res += query(1,id[v],id[u]);
    return res;
}

int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++) scanf("%d",&w[i]);
    memset(h,-1,sizeof(h));
    for(int i=1;i<n;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        add(a,b), add(b,a);
    }
    dfs1(1,-1,1);
    dfs2(1,1);
    build(1,1,n);
    while(m--){
        int t,u,v;
        scanf("%d%d%d",&t,&u,&v);
        if(t == 0) modify_path(u,v);
        else printf("%lld\n",query_path(u,v));
    }
    return 0;
}