#3127. [Usaco2013 Open]Yin and Yang

[Usaco2013 Open]Yin and Yang

题目描述

Farmer John is planning his morning walk on the farm. The farm is structured like a tree: it has nn barns which are connected by n1n-1 edges such that he can reach any barn from any other. Farmer John wants to choose a path which starts and ends at two different barns, such that he does not traverse any edge twice. He worries that his path might be a little long, so he also wants to choose another "rest stop" barn located on this path (which is distinct from the start or the end). Along each edge is a herd of cows, either of the Charcolais (white hair) or the Angus (black hair) variety. Being the wise man that he is, Farmer John wants to balance the forces of yin and yang that weigh upon his walk. To do so, he wishes to choose a path such that he will pass by an equal number of Charcolais herds and Angus herds-- both on the way from the start to his rest stop, and on the way from the rest stop to the end. Farmer John is curious how many different paths he can choose that are "balanced" as described above. Two paths are different only if they consist of different sets of edges; a path should be counted only once even if there are multiple valid "rest stop" locations along the path that make it balanced. Please help determine the number of paths Farmer John can choose!

给出一棵 nn 个点的树,每条边为黑色或白色。问满足以下条件的路径条数:路径上存在一个不是端点的点,使得两端点到该点的路径上两种颜色的边数都相等。

输入格式

  • Line 11 : The integer nn.
  • Lines 2n2 \dots n: Three integers aia_i,bi b_i and tit_i, representing the two barns that edge ii connects. tit_i is 00 if the herd along that edge is Charcolais, and 11 if the herd is Angus.

输出格式

  • Line 11: One integer, representing the number of possible paths Farmer John can choose from.
7 
1 2 0 
3 1 1 
2 4 0 
5 2 0 
6 3 1 
5 7 1
1

样例说明

There are 77 barns and 6 edges. The edges from 11 to 2,22, 2 to 44 and 22 to 55 have Charcolais herds along them. No path of length 22 can have a suitable rest stop on it, so we can only consider paths of length 44. The only path that has a suitable rest stop is 312573-1-2-5-7, with a rest stop at 22.

数据规模与约定

对于 100%100\% 的数据,1n1051 \le n \le 10^5