CodeForces Round #425 (Div. 2) D

Problem Information

source: It’s from the Round #425 (Div. 2) of the codeforces


给出一棵 $n$ 个节点的树,执行 $q$ 次查询,每次从中挑出三个节点,选择一个为终点使得另外两个点到终点的路径重合的点数最多,输出这个点数。

Misha and Grisha are funny boys, so they like to use new underground. The underground has $n$ stations connected with $n-1$ routes so that each route connects two stations, and it is possible to reach every station from any other.

The boys decided to have fun and came up with a plan. Namely, in some day in the morning Misha will ride the underground from station $s$ to station $f$ by the shortest path, and will draw with aerosol an ugly text “Misha was here” on every station he will pass through (including $s$ and $f$). After that on the same day at evening Grisha will ride from station $t$ to station $f$ by the shortest path and will count stations with Misha’s text. After that at night the underground workers will wash the texts out, because the underground should be clean.

The boys have already chosen three stations $a$, $b$ and $c$ for each of several following days, one of them should be station $s$ on that day, another should be station $f$, and the remaining should be station $t$. They became interested how they should choose these stations $s$, $f$, $t$ so that the number Grisha will count is as large as possible. They asked you for help.


The first line contains integer $n\ (1 ≤ n ≤ 3 \times 10^5) $ — the number of vertices in the tree. The second line contains $n - 1$ integers $p_2, p_3, … p_n\ (1 ≤ p_i < i) $, where $p_i$ is the number of the vertex that is the parent of vertex $i$ in the tree.

The first line contains two integers $n$ and $q\ (2 ≤ n ≤ 10^5, 1 ≤ q ≤ 10^5)$ — the number of stations and the number of days.

The second line contains $n - 1$ integers $p_2, p_3, …, p_n\ (1 ≤ p_i ≤ n)$. The integer $p_i$ means that there is a route between stations $p_i$ and $i$. It is guaranteed that it’s possible to reach every station from any other.

The next $q$ lines contains three integers $a, b, c$ each $(1 ≤ a, b, c ≤ n)$ — the ids of stations chosen by boys for some day. Note that some of these ids could be same.


Print $q$ lines. In the i-th of these lines print the maximum possible number Grisha can get counting when the stations $s, t, f$ are chosen optimally from the three stations on the $i$-th day.

Sample Input

3 2
1 1
1 2 3
2 3 3

Sample Output



首先用倍增法求预处理然后可以在线求任意两个结点的 $Lca$,对于每一组查询,我们枚举每个点作为终点,那么每次有两种情况:

  • 终点在两个起点的 $Lca(b,c)$ 的子树内:共同路径节点数就是 $Lca(a,b), Lca(a,c)$ 中不等于 $Lca(b,c)$ 的节点到终点的路径的节点数

  • 终点在两个起点的 $Lca(b,c)$ 的子树外:共同路径节点数就是 $Lca(b,c))$ 到 $a$ 的路径的节点数

AC code

const int log2n = 20;
int n,q;
struct Edge
    int u,v,next;
int cont, head[MaxN];
void add(int u, int v)
    edge[cont].u = u, edge[cont].v = v, edge[cont].next = head[u], head[u] = cont++;

int dep[MaxN], pre[MaxN][log2n], fa[MaxN], dfn[MaxN], low[MaxN], clo;
void dfs(int u)
	pre[u][0] = fa[u], dfn[u] = low[u] = ++clo;
	for (int i=head[u]; i!=-1; i=edge[i].next)
        int v = edge[i].v;
        dep[v] = dep[u]+1;
        low[u] = max(low[u], low[v]);

void lcabinarylifting(int n)
	for(int j=1;(1<<j)<=n;++j)
		for(int i=1;i<=n;++i)
			if(pre[i][j-1]!=-1) pre[i][j]=pre[pre[i][j-1]][j-1];   ///2^j=2^(j-1)+2^(j-1)


inline int lca(int x,int y)
    int D = 0;
    while( (1<<D) <= dep[x])D++;
    for(int i =D;i>=0;i--) if(dep[x]-(1<<i)>=dep[y]) x=pre[x][i];
    if(x==y) return x;
    for(int i=D;i>=0;--i)
        if(pre[x][i]!=-1 && pre[x][i]!=pre[y][i])
    return pre[x][0];
int ans;
void cal(int a,int b,int c)
	int x=lca(b,c);
	int sum=0;
	if(dfn[a]>=dfn[x] && dfn[a]<=low[x])
		int y=lca(a,b),z=lca(a,c); 
		if(y==x) sum=dep[a]-dep[z]+1;
		else sum=dep[a]-dep[y]+1;
		int y=lca(x,a);

void solve()
    clo = 0;
void init()
    cont = 0, MST(head,-1);
    fa[1] = -1, dep[1] = 0;
int main()
    while(~scanf("%d%d", &n, &q))
        for(int u=2;u<=n;u++)
            scanf("%d", &fa[u]);
        int a, b, c;
            scanf("%d%d%d", &a, &b, &c);
            ans = 0;
            printf("%d\n", ans);