最短距离 P4949【树链剖分】

题目链接

---

  有N个点，N条边构成的连通图的话，那么其实就是比树多了一条边，我们可以把多出来的任意一条可替换边存出来，然后对剩下的点来看是要直接走，还是经过这条边的呢？那么，就是树链剖分的维护操作了。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
//#define INF 10000007.
#define eps 1e-7
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 1e5 + 7;
int N, M, head[maxN], cnt, root[maxN], p1, p2, ew;
int fid(int x) { return x == root[x] ? x : root[x] = fid(root[x]); }
struct Eddge
{
    int nex, to, val;
    Eddge(int a=-1, int b=0, int c=0):nex(a), to(b), val(c) {}
}edge[maxN << 1];
inline void addEddge(int u, int v, int w)
{
    edge[cnt] = Eddge(head[u], v, w);
    head[u] = cnt++;
}
inline void _add(int u, int v, int w) { addEddge(u, v, w); addEddge(v, u, w); }
struct E
{
    int u, v, w;
    E(int a=0, int b=0, int c=0):u(a), v(b), w(c) {}
}L[maxN];
int fa[maxN], deep[maxN], siz[maxN], Wson[maxN], WE[maxN], top[maxN], id[maxN], tot, w[maxN];
void dfs_1(int u)
{
    siz[u] = 1;
    int maxx = 0;
    for(int i=head[u], v; ~i; i=edge[i].nex)
    {
        v = edge[i].to;
        if(v == fa[u]) continue;
        deep[v] = deep[u] + 1; fa[v] = u;
        dfs_1(v);
        if(siz[v] > maxx)
        {
            maxx = siz[v];
            Wson[u] = v;
            WE[u] = edge[i].val;
        }
    }
}
void dfs_2(int u, int topf, int wval)
{
    top[u] = topf;
    id[u] = ++tot;
    w[tot] = wval;
    if(!Wson[u]) return;
    dfs_2(Wson[u], topf, WE[u]);
    for(int i=head[u], v; ~i; i=edge[i].nex)
    {
        v = edge[i].to;
        if(v == fa[u] || v == Wson[u]) continue;
        dfs_2(v, v, edge[i].val);
    }
}
int tree[maxN << 2];
void buildTree(int rt, int l, int r)
{
    if(l == r)
    {
        tree[rt] = w[l];
        return;
    }
    int mid = HalF;
    buildTree(Lson); buildTree(Rson);
    tree[rt] = tree[lsn] + tree[rsn];
}
void update(int rt, int l, int r, int qx, int val)
{
    if(l == r) { tree[rt] = val; return; }
    int mid = HalF;
    if(qx <= mid) update(Lson, qx, val);
    else update(Rson, qx, val);
    tree[rt] = tree[lsn] + tree[rsn];
}
int query(int rt, int l, int r, int ql, int qr)
{
    if(ql <= l && qr >= r) return tree[rt];
    int mid = HalF;
    if(qr <= mid) return query(QL);
    else if(ql > mid) return query(QR);
    else return query(QL) + query(QR);
}
int qRange(int u, int v)
{
    int ans = 0;
    while(top[u] ^ top[v])
    {
        if(deep[top[u]] < deep[top[v]]) swap(u, v);
        ans += query(1, 1, N, id[top[u]], id[u]);
        u = fa[top[u]];
    }
    if(deep[u] > deep[v]) swap(u, v);
    if(id[u] < id[v]) ans += query(1, 1, N, id[u] + 1, id[v]);
    return ans;
}
inline void init()
{
    cnt = tot = 0;
    for(int i=1; i<=N; i++)
    {
        head[i] = -1;
        root[i] = i;
    }
}
int main()
{
    scanf("%d%d", &N, &M);
    init();
    for(int i=1, u, v, w, fu, fv; i<=N; i++)
    {
        scanf("%d%d%d", &u, &v, &w);
        L[i] = E(u, v, w);
        fu = fid(u); fv = fid(v);
        if(fu ^ fv)
        {
            root[fu] = fv;
            _add(u, v, w);
        }
        else { p1 = u; p2 = v; ew = i; }    //两个特殊的点
    }
    fa[1] = 0; deep[1] = 1;
    dfs_1(1);
    dfs_2(1, 1, 0);
    buildTree(1, 1, N);
    int op, x, y, u, v, ans;
    while(M --)
    {
        scanf("%d%d%d", &op, &x, &y);
        if(op == 1)
        {
            if(x == ew) L[ew].w = y;
            else
            {
                u = L[x].u; v = L[x].v;
                if(deep[u] > deep[v]) update(1, 1, N, id[u], y);
                else update(1, 1, N, id[v], y);
            }
        }
        else
        {
            ans = qRange(x, y);
            ans = min(ans, qRange(x, p1) + L[ew].w + qRange(y, p2));
            ans = min(ans, qRange(x, p2) + L[ew].w + qRange(y, p1));
            printf("%d\n", ans);
        }
    }
    return 0;
}