A Treepath
这类操作很常见,将两个点的距离转化为,两个点分别到树上的距离。
d(a,b) = abs(dist[a] - dist[b])
然后我们又发现 ,奇数和奇数组合与偶数和偶数组合是我们的和法方案,我们记录树的深度,然后统奇偶个数。
然后组合输出
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 200010;
int n;
int h[N], e[N], ne[N], idx;
int d[N];
ll odd, even;
void add(int a, int b)
{
e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}
void dfs(int x, int fa)
{
for (int i = h[x]; ~i; i = ne[i])
{
int y = e[i];
if (y == fa) continue;
d[y] = d[x] + 1;
dfs(y, x);
}
}
int main()
{
memset(h, -1, sizeof h);
cin >> n;
for (int i = 1; i < n; i ++ )
{
int x, y; cin >> x >> y;
add(x, y); add(y, x);
}
dfs(1, -1);
for (int i = 1; i <= n; i ++ )
{
// cout << d[i] << ' ';
if (d[i] & 1) odd ++;
else even ++;
}
// cout << endl;
cout << (even - 1) * even / 2 + (odd - 1) * odd / 2 << endl;
}