leetcode 5188 树节点的第 K 个祖先 倍增

题意 : 多次询问一个树节点往上跳$K$步会到达那个节点,超出根输出$-1$
基础倍增,我居然蠢到把图给重新建出来…
用跳表记录当前点向上跳$2^1,2^2,2^3,....2^k$步会到那个点即可
关键公式 : $up[u][i]=up[up[u][i-1]][i-1]$

#define MAXN (int(1e5+7))
#define L (20)
int up[MAXN][25];
int level[MAXN];
vector<int> G[MAXN];

class TreeAncestor {
public:
    int n;
    void dfs(int u, int fa) {
        up[u][0] = fa;
        level[u] = level[fa] + 1;
        for(int i=1; i<=L; i++)
            up[u][i] = up[up[u][i-1]][i-1];
        for(auto v : G[u])
            if(v != fa) dfs(v, u);
    }
    
    TreeAncestor(int _n, vector<int>& tree) {
        n = _n;
        for(int i=0; i<=n; i++) G[i].clear(), level[i] = 0;
        for(int i=0; i<n; i++)
            if(~tree[i])
                G[i].push_back(tree[i]), G[tree[i]].push_back(i);
        dfs(0, 0);
    }
    
    int getKthAncestor(int u, int k) {
        if(level[u] <= k) return -1;
        int i = 0, ans = 0;
        for(i=L; i>=0; i--) {
            if((1<<i) <= k) k -= (1 << i), ans = up[u][i], u = up[u][i];
        }
        
        return ans;
    }
};