『LCA·树形DP换根』CF629E Famil Door and Roads

$\mathrm{P}\mathrm{r}\mathrm{o}\mathrm{b}\mathrm{l}\mathrm{e}\mathrm{m}$

Famil Door’s City map looks like a tree (undirected connected acyclic graph) so other people call it Treeland. There are $n$ intersections in the city connected by $n-1$ bidirectional roads.

There are $m$ friends of Famil Door living in the city. The $i$ -th friend lives at the intersection $u_i$ and works at the intersection $v_i$ . Everyone in the city is unhappy because there is exactly one simple path between their home and work.

Famil Door plans to construct exactly one new road and he will randomly choose one among $n\cdot (n-1)/2$ possibilities. Note, that he may even build a new road between two cities that are already connected by one.

He knows, that each of his friends will become happy, if after Famil Door constructs a new road there is a path from this friend home to work and back that doesn't visit the same road twice. Formally, there is a simple cycle containing both $u_i$ and $v_i$ .

Moreover, if the friend becomes happy, his pleasure is equal to the length of such path (it's easy to see that it's unique). For each of his friends Famil Door wants to know his expected pleasure, that is the expected length of the cycle containing both $u_i$ and$ v_{i}$ if we consider only cases when such a cycle exists.

---

$\mathrm{T}\mathrm{r}\mathrm{a}\mathrm{n}\mathrm{s}\mathrm{l}\mathrm{a}\mathrm{t}\mathrm{i}\mathrm{o}\mathrm{n}$

给出一棵 $n$ 个节点的树。

有 $m$ 个询问，每一个询问包含两个数$a、b$，

我们可以对任意两个不相连的点连一条无向边，

并且使得加上这条边后 $a，b$ 处在一个环内。

对于每一个询问，求这样的环的期望长度。

---

$\mathrm{S}\mathrm{o}\mathrm{l}\mathrm{u}\mathrm{t}\mathrm{i}\mathrm{o}\mathrm{n}$

这道题我们需要分类讨论。

当询问节点 $u$ 和 $v$ 无祖先关系时。

我们在两个节点的子树中个选择一个点即能构成环。

那个方案数为$\mathrm{s}\mathrm{i}\mathrm{z}{\mathrm{e}}_{\mathrm{u}}\times \mathrm{s}\mathrm{i}\mathrm{z}{\mathrm{e}}_{\mathrm{v}}$,那么我们包含的答案为：$$(\mathrm{d}\mathrm{i}\mathrm{s}(u,v)+1)\times \mathrm{s}\mathrm{i}\mathrm{z}{\mathrm{e}}_{\mathrm{x}}\times \mathrm{s}\mathrm{i}\mathrm{z}{\mathrm{e}}_{\mathrm{v}}$$

我们考虑还有哪些贡献，发现每一个子树内的节点到根节点的距离被计算了另一个子树的大小次，因此我们根据每一个节点的贡献，我们可以得到如下贡献：

$$\mathrm{s}\mathrm{i}\mathrm{z}{\mathrm{e}}_{\mathrm{y}}\sum _{x\in so{n}_u}di{s}_x+\mathrm{s}\mathrm{i}\mathrm{z}{\mathrm{e}}_{\mathrm{x}}\sum _{x\in so{n}_v}di{s}_x$$

我们现在考虑如何计算出$f_x={\sum }_{i\in son(x)}di{s}_i$,很容易发现有状态转移方程：

$$f_x=\sum (f_y+\mathrm{s}\mathrm{i}\mathrm{z}{\mathrm{e}}_{\mathrm{y}})$$

---

当 $u$ 和 $v$ 存在祖先关系时（假设 $u$ 是 $v$ 的祖先）

$u$选择上面以及不是$v$所在子树的任意节点。$v$选择子树。

设 $less$ 为 $v$ 到 $u$ 路径中的倒数第二个点。则方案数可以表示为：
$$\mathrm{c}\mathrm{n}\mathrm{t}=(n-\mathrm{s}\mathrm{i}\mathrm{z}{\mathrm{e}}_{\mathrm{l}\mathrm{e}\mathrm{s}\mathrm{s}})\times \mathrm{s}\mathrm{i}\mathrm{z}{\mathrm{e}}_{\mathrm{v}}$$
而且我们$u$上面和其他子树的深度贡献，我们可以设$g_x$表示所有节点到$x$的深度之和，这是树形DP换根的基础操作，再用$g_x-\mathrm{s}\mathrm{i}\mathrm{z}{\mathrm{e}}_{\mathrm{y}}-f_y$即为答案。

最后泪乘即可。

---

$\mathrm{C}\mathrm{o}\mathrm{d}\mathrm{e}$

#include <bits/stdc++.h>
#define int long long
#define LL long long

using namespace std;
const int N = 2e5;

int n, m;
int fa[N], dep[N], top[N], size[N], son[N], f[N], g[N], up[N][30];
vector < int > a[N];

int read(void)
{
	int s = 0, w = 0; char c = getchar();
	while (c < '0' || c > '9') w |= c == '-', c = getchar();
	while (c >= '0' && c <= '9') s = s*10+c-48, c = getchar();
	return w ? -s : s;
}

void Dfs1(int x, int father)
{
	int Max = 0;
	size[x] = 1;
	fa[x] = up[x][0] = father;
	dep[x] = dep[father] + 1;
	for (int i=0;i<a[x].size();++i)
	{
		int y = a[x][i];
		if (y == father) continue;
		Dfs1(y, x);
		size[x] += size[y];
		f[x] += f[y] + size[y];
		if (size[y] > Max) Max = size[son[x] = y];
	}
	return;
}

void Dfs2(int x,int cur)
{
	top[x] = cur;
	if (son[x]) {
		g[son[x]] = g[x] - size[son[x]] + (n - size[son[x]]);
		Dfs2(son[x], cur);
	}
	for (int i=0;i<a[x].size();++i)
	{
		int y = a[x][i];
		if (y == fa[x] || y == son[x]) continue;
		g[y] = g[x] - size[y] + (n - size[y]);
		Dfs2(y, y);
	}
	return;
}

int LCA(int x, int y)
{
	while (top[x] ^ top[y])
	{
		if (dep[top[x]] < dep[top[y]]) swap(x, y);
		x = fa[top[x]];
	}
	return dep[x] < dep[y] ? x : y;
}

void DP(void)
{
	for (int j=1;j<=20;++j)
		for (int i=1;i<=n;++i)
			up[i][j] = up[up[i][j-1]][j-1];
	return;
}

int Get(int u,int v)
{
	for (int i=20;i>=0;--i)
	{
		if (up[u][i] == 0) continue;
		if (dep[up[u][i]] > dep[v]) u = up[u][i];
	}
	return u;
}

void work(void)
{
	int u = read(), v = read();
	int P = LCA(u, v);
	if (u != P and v != P)
	{
		LL cnt = 1LL * size[u] * size[v];
		LL sum = 1LL * size[v] * f[u] + 1LL * size[u] * f[v];
		sum += cnt * (dep[u] + dep[v] - 2 * dep[P] + 1);
		printf("%.8lf\n", 1.0 * sum / cnt);
		return;
	}
	if (dep[u] < dep[v]) swap(u, v);
	int less = Get(u, v);
	LL cnt = 1LL * size[u] * (n - size[less]);
	LL sum = 1LL * (n - size[less]) * f[u] + size[u] * (g[v] - f[less] - size[less]);
	sum += 1LL * cnt * (dep[u] - dep[v] + 1);
	printf("%.8lf\n", 1.0 * sum / cnt);
	return;
}

signed main(void)
{
	n = read(), m = read();
	for (int i=1;i<n;++i)
	{
		int x = read(), y = read();
		a[x].push_back(y);
		a[y].push_back(x);
	}
	Dfs1(1, 0), g[1] = f[1];
	Dfs2(1, 1), DP();
	while (m --) work(); 
	return 0;
}