# CF1060E Sergey and Subway

• 135通过
• 220提交
• 题目来源
• 评测方式 RemoteJudge
• 标签 分治 概率论,统计 深度优先搜索,DFS
• 难度 省选/NOI-
• 时空限制 2000ms / 512MB
• 提示：收藏到任务计划后，可在首页查看。

## 题意翻译

给出一颗$N$个节点的树,现在我们在原图中每个不直接连边但是中间只间隔一个点的两个点之间连一条边.

比如在原图中$u$与$v$连边,$v$与$w$连边,但是$u$与$w$不连边,这时候我们就需要连一条$u$与$v$的边.

现在我们需要求出新图中每一个点对$(i,j)\ (1 \leq i \leq j \leq N)$的经过的边数和.

## 题目描述

Sergey Semyonovich is a mayor of a county city N and he used to spend his days and nights in thoughts of further improvements of Nkers' lives. Unfortunately for him, anything and everything has been done already, and there are no more possible improvements he can think of during the day (he now prefers to sleep at night). However, his assistants have found a solution and they now draw an imaginary city on a paper sheet and suggest the mayor can propose its improvements.

Right now he has a map of some imaginary city with $n$ subway stations. Some stations are directly connected with tunnels in such a way that the whole map is a tree (assistants were short on time and enthusiasm). It means that there exists exactly one simple path between each pair of station. We call a path simple if it uses each tunnel no more than once.

One of Sergey Semyonovich's favorite quality objectives is the sum of all pairwise distances between every pair of stations. The distance between two stations is the minimum possible number of tunnels on a path between them.

Sergey Semyonovich decided to add new tunnels to the subway map. In particular, he connected any two stations $u$ and $v$ that were not connected with a direct tunnel but share a common neighbor, i.e. there exists such a station $w$ that the original map has a tunnel between $u$ and $w$ and a tunnel between $w$ and $v$ . You are given a task to compute the sum of pairwise distances between all pairs of stations in the new map.

## 输入输出格式

输入格式：

The first line of the input contains a single integer $n$ ( $2 \leq n \leq 200\,000$ ) — the number of subway stations in the imaginary city drawn by mayor's assistants. Each of the following $n - 1$ lines contains two integers $u_i$ and $v_i$ ( $1 \leq u_i, v_i \leq n$ , $u_i \ne v_i$ ), meaning the station with these indices are connected with a direct tunnel.

It is guaranteed that these $n$ stations and $n - 1$ tunnels form a tree.

输出格式：

Print one integer that is equal to the sum of distances between all pairs of stations after Sergey Semyonovich draws new tunnels between all pairs of stations that share a common neighbor in the original map.

## 输入输出样例

输入样例#1： 复制
4
1 2
1 3
1 4

输出样例#1： 复制
6

输入样例#2： 复制
4
1 2
2 3
3 4

输出样例#2： 复制
7


## 说明

In the first sample, in the new map all pairs of stations share a direct connection, so the sum of distances is $6$ .

In the second sample, the new map has a direct tunnel between all pairs of stations except for the pair $(1, 4)$ . For these two stations the distance is $2$ .

提示
标程仅供做题后或实在无思路时参考。
请自觉、自律地使用该功能并请对自己的学习负责。
如果发现恶意抄袭标程，将按照I类违反进行处理。