基于二分
vector<int>G[200]; //邻接表存图
int root = 0;
int par[100][200]; //向上走2^k步所到的节点(超过根时记为-1)
int depth[200];
void dfs(int v,int p,int d)
{
par[0][v] = p;
depth[v] = d;
for (int i = 0; i<G[v].size(); i++) {
if (G[v][i] != p) {
dfs(G[v][i], v, d+1);
}
}
}
void init(int num)
{
dfs(root, -1, 0);
for (int k = 0; k+1<100; k++) {
for (int v = 0; v<=num; v++) {
if (par[k][v]<0) {
par[k+1][v] = -1;
}
else
par[k+1][v] = par[k][par[k][v]];
}
}
}