二分图 Codeforces - 862B Mahmoud and Ehab and the bipartiteness

Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.

A tree is a connected acyclic graph. A bipartite graph is a graph, whose vertices can be partitioned into 2 sets in such a way, that for each edge (u, v) that belongs to the graph, u and v belong to different sets. You can find more formal definitions of a tree and a bipartite graph in the notes section below.

Dr. Evil gave Mahmoud and Ehab a tree consisting of n nodes and asked them to add edges to it in such a way, that the graph is still bipartite. Besides, after adding these edges the graph should be simple (doesn't contain loops or multiple edges). What is the maximum number of edges they can add?

A loop is an edge, which connects a node with itself. Graph doesn't contain multiple edges when for each pair of nodes there is no more than one edge between them. A cycle and a loop aren't the same .

Input

The first line of input contains an integer n — the number of nodes in the tree (1 ≤ n ≤ 10⁵).

The next n - 1 lines contain integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the description of the edges of the tree.

It's guaranteed that the given graph is a tree.

Output

Output one integer — the maximum number of edges that Mahmoud and Ehab can add to the tree while fulfilling the conditions.

Example

Input

3
1 2
1 3

Output

0

Input

5
1 2
2 3
3 4
4 5

Output

2

Note

Tree definition: https://en.wikipedia.org/wiki/Tree_(graph_theory)

Bipartite graph definition: https://en.wikipedia.org/wiki/Bipartite_graph

In the first test case the only edge that can be added in such a way, that graph won't contain loops or multiple edges is (2, 3), but adding this edge will make the graph non-bipartite so the answer is 0.

In the second test case Mahmoud and Ehab can add edges (1, 4) and (2, 5).

题意：题目给出二分图的一部分边，问最多可以再添加多少条边。二分图的最大边数为（集合u内数的个数*集合v内数的个数）。

这道题最麻烦的地方在于建图，我是用的邻接表建图，建好之后，只需要dfs搜索一遍，把深度为偶数的标记为一个值t1，深度为奇数的标记为另一个值t2。结果就是t1*t2-n+1。

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
vector<int> v[100015];
int n,a,b,vis[100005];
ll t1,t2;
void dfs(int deep,int t){
	if(deep%2)
		t1++;
	else
		t2++;
	for(int i=0;i<v[t].size();i++){
		if(!vis[v[t][i]]){
			vis[v[t][i]]=1;
			dfs(deep+1,v[t][i]);
			vis[v[t][i]]=0;
		}
	}
}

int main()
{
	while(~scanf("%d",&n)){
		t1=t2=0;
		for(int i=0;i<100005;i++)
			v[i].clear();
		memset(vis,0,sizeof(vis));
		for(int i=0;i<n-1;i++){
			scanf("%d%d",&a,&b);
			v[a].push_back(b);
			v[b].push_back(a);
		}
		vis[1]=1;
		dfs(0,1);
		printf("%lld\n",t1*t2-n+1);
	}
	return 0;
}