graph/tree/doubling-lowest-common-ancestor.hpp

• View this file on GitHub
• Last update: 2024-10-04 14:05:18+02:00
• Include: #include "graph/tree/doubling-lowest-common-ancestor.hpp"

Depends on

• graph/graph-template.hpp

Verified with

• test/aoj-grl-5-c.test.cpp

Code

#include "../graph-template.hpp"
/*
树上倍增找 lca
*/

template <typename T = int>
struct DoublingLowestCommonAncestor : Graph<T> {
    using Graph<T>::g;
    vector<int> dep;
    vector<T> sum;
    vector<vector<int> > table;
    const int LOG;

    explicit DoublingLowestCommonAncestor(int n)
        : Graph<T>(n), LOG(32 - __builtin_clz(g.size())) {}

    explicit DoublingLowestCommonAncestor(const Graph<T> &g)
        : LOG(32 - __builtin_clz(g.size())), Graph<T>(g) {}

    void build(int root = 0) {
        dep.assign(g.size(), 0);
        sum.assign(g.size(), 0);
        table.assign(LOG, vector<int>(g.size(), -1));
        dfs(root, -1, 0);
        for (int k = 0; k + 1 < LOG; k++) {
            for (int i = 0; i < (int)table[k].size(); i++) {
                if (table[k][i] == -1)
                    table[k + 1][i] = -1;
                else
                    table[k + 1][i] = table[k][table[k][i]];
            }
        }
    }

    int lca(int u, int v) {
        if (dep[u] > dep[v]) swap(u, v);
        v = climb(v, dep[v] - dep[u]);
        if (u == v) return u;
        for (int i = LOG - 1; i >= 0; i--) {
            if (table[i][u] != table[i][v]) {
                u = table[i][u];
                v = table[i][v];
            }
        }
        return table[0][u];
    }

    int climb(int u, int k) {
        if (dep[u] < k) return -1;
        for (int i = LOG - 1; i >= 0; i--) {
            if ((k >> i) & 1) u = table[i][u];
        }
        return u;
    }

    T dist(int u, int v) { return sum[u] + sum[v] - 2 * sum[lca(u, v)]; }

   private:
    void dfs(int idx, int par, int d) {
        table[0][idx] = par;
        dep[idx] = d;
        for (auto &to : g[idx]) {
            if (to != par) {
                sum[to] = sum[idx] + to.cost;
                dfs(to, idx, d + 1);
            }
        }
    }
};

#line 2 "graph/graph-template.hpp"
#include <bits/stdc++.h>
using namespace std;

template <typename T = int>
struct Edge {
    int from, to;
    T cost;
    int idx;

    Edge() = default;

    Edge(int from, int to, T cost = 1, int idx = -1)
        : from(from), to(to), cost(cost), idx(idx) {}

    operator int() const { return to; }
};

template <typename T = int>
struct Graph {
    vector<vector<Edge<T> > > g;
    int es;

    Graph() = default;

    explicit Graph(int n) : g(n), es(0) {}

    size_t size() const { return g.size(); }

    virtual void add_directed_edge(int from, int to, T cost = 1) {
        g[from].emplace_back(from, to, cost, es++);
    }

    // virtual 可以被重载，实现多态
    virtual void add_edge(int from, int to, T cost = 1) {
        g[from].emplace_back(from, to, cost, es);
        g[to].emplace_back(to, from, cost, es++);
    }

    void read(int M, int padding = -1, bool weighted = false,
              bool directed = false) {
        for (int i = 0; i < M; i++) {
            int a, b;
            cin >> a >> b;
            a += padding;
            b += padding;
            T c = T(1);
            if (weighted) cin >> c;
            if (directed)
                add_directed_edge(a, b, c);
            else
                add_edge(a, b, c);
        }
    }

    inline vector<Edge<T> > &operator[](const int &k) { return g[k]; }

    inline const vector<Edge<T> > &operator[](const int &k) const { return g[k]; }
};

template <typename T = int>
using Edges = vector<Edge<T> >;
#line 2 "graph/tree/doubling-lowest-common-ancestor.hpp"
/*
树上倍增找 lca
*/

template <typename T = int>
struct DoublingLowestCommonAncestor : Graph<T> {
    using Graph<T>::g;
    vector<int> dep;
    vector<T> sum;
    vector<vector<int> > table;
    const int LOG;

    explicit DoublingLowestCommonAncestor(int n)
        : Graph<T>(n), LOG(32 - __builtin_clz(g.size())) {}

    explicit DoublingLowestCommonAncestor(const Graph<T> &g)
        : LOG(32 - __builtin_clz(g.size())), Graph<T>(g) {}

    void build(int root = 0) {
        dep.assign(g.size(), 0);
        sum.assign(g.size(), 0);
        table.assign(LOG, vector<int>(g.size(), -1));
        dfs(root, -1, 0);
        for (int k = 0; k + 1 < LOG; k++) {
            for (int i = 0; i < (int)table[k].size(); i++) {
                if (table[k][i] == -1)
                    table[k + 1][i] = -1;
                else
                    table[k + 1][i] = table[k][table[k][i]];
            }
        }
    }

    int lca(int u, int v) {
        if (dep[u] > dep[v]) swap(u, v);
        v = climb(v, dep[v] - dep[u]);
        if (u == v) return u;
        for (int i = LOG - 1; i >= 0; i--) {
            if (table[i][u] != table[i][v]) {
                u = table[i][u];
                v = table[i][v];
            }
        }
        return table[0][u];
    }

    int climb(int u, int k) {
        if (dep[u] < k) return -1;
        for (int i = LOG - 1; i >= 0; i--) {
            if ((k >> i) & 1) u = table[i][u];
        }
        return u;
    }

    T dist(int u, int v) { return sum[u] + sum[v] - 2 * sum[lca(u, v)]; }

   private:
    void dfs(int idx, int par, int d) {
        table[0][idx] = par;
        dep[idx] = d;
        for (auto &to : g[idx]) {
            if (to != par) {
                sum[to] = sum[idx] + to.cost;
                dfs(to, idx, d + 1);
            }
        }
    }
};

Back to top page